Networking- diffie-hellman question, please help!

(20 points) Let's explore the Diffie-Hellman (DH) public-key encryption algorithm, which allows two entities to agree on a shared key. The DH algorithm makes use of a large prime number p and another large numberg less than p. Both p and g are made public. In DH, Alice and Bob each independently choose secret keys, a and b, respectively. Alice then computes her public key, A, by raising g to a and then taking mod p; Bob similarly computes his own public key, B, by raising g to b and then taking mod p. Alice and Bob then exchange their public keys over the Internet. Alice then calculates the shared secret key S by raising B to a and then taking mod p. Similarly, Bob calculates the shared key S' by raising A to b and then taking mod p. a. With p 13 and g-2, suppose Alice and Bob choose private keysa-7 and b-10, respectively. Calculate Alice's and Bob's public keys, A and b. Following up with (a), calculate S as the shared symmetric key Provide a time diagram that show how DH can be attacked by a man- in-the-middle. The timing diagram should have three vertical times one for Alice, one for Bob, and one for the attacker Trudy. (Refer to page 44 of lecture notes on networksecurity) c