In this exercise you're going to do a "known plaintext attack on the Affine Cipher. I only briefly talked about this cipher in class - I'll remind you how it works. Alice and Bob agree on, and publish, a large prime p. They also choose, and keep as a shared secret, two integers a, b, with a #0 (mod p). Alice encrypts the plaintext r (mod p), obtaining ciphertext y (mod p) by computing y = ar +b (mod p) and sends it to Bob. Bob then recovers x by computing r=a-y-b) (mod p) Bob then encrypts a plaintext i + r in the same way with the same key (uh-oh), obtaining a ciphertext y = a + b, and sends y to Alice, who decrypts it in the same way. Suppose Eve learns the values of p, x, y, T, . How can Eve solve for a and b?|| In this exercise you're going to do a "known plaintext attack on the Affine Cipher. I only briefly talked about this cipher in class - I'll remind you how it works. Alice and Bob agree on, and publish, a large prime p. They also choose, and keep as a shared secret, two integers a, b, with a #0 (mod p). Alice encrypts the plaintext r (mod p), obtaining ciphertext y (mod p) by computing y = ar +b (mod p) and sends it to Bob. Bob then recovers x by computing r=a-y-b) (mod p) Bob then encrypts a plaintext i + r in the same way with the same key (uh-oh), obtaining a ciphertext y = a + b, and sends y to Alice, who decrypts it in the same way. Suppose Eve learns the values of p, x, y, T, . How can Eve solve for a and b?||