1) Using any programming language of your choice implement the RSA algortithm

2) The implementation should have 3 parts: key generation, encryption and decryption

3) Key generation should take the values p and q as input and generate n, e and d

NB: Calculating the value of e requires the use of the extended eulcidean algorithm to calculate modular multiplicative inverses. Your implementation may skip this and request for the manual input of e by presenting the value of totient n to the user.

4) Encryption should take a short string as input, convert it into an integer and encrypt it.

5) Decryption should take an integer value as input, decrypt it and output the corresponding string

6)Please document your code

7) Submit your code and a detailed Readme file, which should explain how to run the code with sample input and output, in a zipped folder by the due date