10. Suppose #M = #C. Prove that for a fixed key k E K and a fixed ciphertext cec, there is a unique plaintext m E M such that e(k, m) = c. (Hint: this is a counting argument using the fact that ek is 1-1)