2) Use Euler's (n) phifunction to find (36) SHOW ALL WORK. 3) Use modular exponentiation to find 454mod21 JUST SET UP JUST SHOW ONE STATEMENT DO NOT SHOW FURTHER recursion 45454545mod21 4) In RSA to send a MESSAGE you encrypt using the recipient's (multiple choic 2 parts) secret key b) public key d the recipient decrypts using a) her secret key our public key c) your secret key to decrypt message