Alice decides to set up an RSA public key encryption using the two primes p = 31 and q = 41 and the encryption key e = 11. You must show all calculations, including MOD- calculations using the division algorithm! (1) Bob decides to send the message M = 30 to her using this encryption. What is the code C that he will send her? (2) What is Alice's decryption key d? Remember that you have to show all your work using the Euclidean algorithm. (3) Alice also receives the message C = 101 from Carla. What was her original message M?

Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…