Exercise 6: Assume a public-key encryption scheme for single-bit messages (with no decryption error). Show that, given pk and a ciphertext c computed via cEncple(m), it is possible for an unbounded adversary to determine m with probability 1. This shows that perfectly-secret public- key encryption is impossible