Let (G,E,D) be a public-key encryption (PKE) scheme (without decryption error). Show that perfectly secure PKE do not exist. For that, show that given pk and a ciphertext c computed as c = E(pk,m), it is possible for a computationally unbounded adversary to determine m with probability 1.