Perform encryption and decryption using the RSA algorithm: 1. p = 3; q = 11, e = 7; M = 5 2. p = 5; q = 11, e = 3; M = 9 3. p = 7; q = 11, e = 17; M= 8 4. p = 11; q = 13, e = 11; M = 7 5. p = 17; q = 31, e = 7; M = 2 Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a = 2. 1. Show that 2 is a primitive root of 11. 2. If user A has public key Ya = 9, what is A's private key Xa? 3. If user B has public key Yb = 3, what is the secret key K shared with A?