3. Here is an example of the man-in-the-middle attack. It has the advantage that Oscar, the opponent, does not have to intercept and retransmit all the messages between Bob and Alice. Suppose Oscar discovers that p = Mg +1, where q is prime and M is small. Oscar intercepts at and all by some scheme. He sends Bob (ar) q (mod p) and sends Alice (a) q (mod p). a. Show that Alice and Bob each calculate the same key. b. Show that there are only M possible values for K, so Oscar may find K by exhaustive search. 3. Here is an example of the man-in-the-middle attack. It has the advantage that Oscar, the opponent, does not have to intercept and retransmit all the messages between Bob and Alice. Suppose Oscar discovers that p = Mg +1, where q is prime and M is small. Oscar intercepts at and all by some scheme. He sends Bob (ar) q (mod p) and sends Alice (a) q (mod p). a. Show that Alice and Bob each calculate the same key. b. Show that there are only M possible values for K, so Oscar may find K by exhaustive search