A generalization of the Caesar cipher, known as the affine Caesar cipher, has the following form: For each plaintext letter p, substitute the ciphertext letter C : C=E([a, b], p)=(a p b) 26 A basic requirement of any encryption algorithm is that it be one-to-one. That is, if p ≠q, then E(k, p) ≠E(k, q). Otherwise, decryption is impossible, because more than one plaintext character maps into the same ciphertext character. The affine Caesar cipher is not one-to-one for all values of a. For example

Decrypt the message m1​, encrypted with an affine cipher,m1​=​... | Filo

Problem 1 (Affine Cipher): An affine cipher has the form c = (am b) n. Suppose m is aninteger between 0 and 25, each integer representing a letter.1. Let n = 26, a = 3, and b = 123. What is the ciphertext corresponding to the phraseTHIS IS A CIPHER MESSAGE2. A requirement for a cipher is that every plaintext letter corresponds to a different ciphertextletter. If a and b are not relatively prime to n, does the affine cipher meet this property? Ifso, prove it. Otherwise, present a counterexampl