Let = (Gen,Enc, Dec) be a public-key encryption scheme for single-bit messages.

Assuming has no decryption error, show that there is an unbounded adversary A that, on input pk and c outputs m with probability 1.