Say you want to encrypt a single message Min$\{0,1,2\}$ using a random shared key Kin$\{0,1,2\}$ as in the previous problem. Can you possibly come up with a protocol that gets you perfect secrecy$?$ Clearly, you know that perfect secrecy means the following $-$ The adversary gains no new knowledge about the plaintext from the ciphertext.