Suppose Alice and Bob want to establish a shared secret key using the Diffie-Hellman key exchange algorithm. Alice chooses a prime number p = 17 and a primitive root g = 3. Bob chooses a secret integer a = 7, and Alice chooses a secret integer b = 11. A. Calculate the public key for Bob. B. Calculate the public key for Alice. C. Calculate the shared secret key. *Hint: The Diffie-Hellman key exchange algorithm involves several steps, such as selecting a prime number and a primitive root, generating public and private keys, and exchanging the public keys between the parties. You can refer to any Diffie-Hellman tutorial or resource to understand these steps in detail.