Problem 5.1, [10 points]. Assume a public-key encryption scheme for singlebit messages (i.e. the message space is {0, 1}}. Show that, given a public key pic and a ciphertext c computed by encrypting a random message or. under pk, it is possible for a computationally unbounded adversary to determine m with probability 1. (That shows that perfectly-secret public-key encryption is impossible.) You can assume that a randomised algorithm draws its randomness from a nite randonmess space. Problem 5.2, [1|] points]. A startnp is marketing a novel public-key determin- istic order-preserving encryption scheme. More precisely, messages and ciphertexts can be viewed as numbers and the ciphertexts preserve the order of the plaintexts. Namely, for every pk: and every M1,M2, if M1