(a). A generalization of the Caesar cipher, known as the affine Caesar cipher, has the fol- lowing form: For each plaintext letter p, substitute the ciphertext letter C: C-E( [a, b], p-(ap + b) mod 26 A basic requirement of any encryption algorithm is that it be one-to-one. That is, if p f q, then E(k,p) ^ E(k,q). Do you think the above encryption algorithm satisfies this requirement for all values of a and b? Explain why or why not. (10 points)