1. Use the RSA algorithm to encipher and decipher the following: a) p=5,q=11,e=3,M=9 b) p=7,q=11,e=17,M=8 c) p=11,q=13,e=11,M=7 d) p=17,q=31,e=7,M=2 e) p=3,q=11,e=7,M=5 2. Given that e=31 and n=3599,(n)=3480, identify the possible values of p and q. 3. Suppose Bob uses the RSA cryptosystem with a very large modulus n for which the factorization cannot be found in a reasonable amount of time. Suppose Alice sends a message to Bob by representing each alphabetic character as an integer between 0 and 25(A, ..., Z), and then encrypting each number separately using RSA with large e and large n. Is this method secure? If not, describe the most efficient attack against this encryption method