Question 5 a) Roger wants to send Simon a message asking him to transfer RM6,000 to his account. Roger wishes to use RSA algorithm to encrypt this message and send to Simon. Suppose Roger's RSA modulus n = 55 = 5 x 11 and his decryption key d = 37, determine the encryption key e. Show your working. Is this possible for large values of n say of the order of 1024 bits? Give your reasons in not more than two or three sentences. b) Alif wishes to invest in shares on ABC Sdn Berhad an e-commerce company. He asks Puteri his professional fund manager to buy 100 lot of shares by sending him an authenticated message M = 14 using RSA algorithm. Alif uses public key n = 119, e = 13, and private key d = 37. Derive the signature that would be used by Alif. Explain how Puteri would verify Alif's signature