Problem 3-RSA Note: A similar problem can be found in Chapter 21 in the textbook (pg. 649). Perform encryption and decryption using the RSA algorithm, as in Figure 21.8 in the textbook, for the following: p = 11; q = 3, e = 3, M = 8 Problem 4-Diffie-Hellman Note: The following problem can be found in Chapter 21 in the textbook (21.12). Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root a = 2. a. If user A has public key Ya = 9, what is A's private key Xa? b. If user B has public key Yb = 3, what is the shared secret key K