Consider the following public-key encryption scheme. The public key is (p, g, h) and the private key a is generated as in El-Gamal encryption scheme. The plaintext space P = {0, 1}. In order to encrypt a bit b, the sender does the following: If b = 0, then choose uniformly y subset Z_p and compute c_1 = g^y (mod p) and c_2 = h^y (mod p). The ciphertext is (c_1, c_2). If b = 1, then choose uniformly and independently y, z subset Z_p, and compute c_1 = g^y (mod p) and c_2 = g^z (mod p). The ciphertext is (c_1, c_2). Show that it is possible to decrypt correctly and efficiently given the knowledge of a. But you don't need to proof this. Consider the following public-key encryption scheme. The public key is (p, g, h) and the private key a is generated as in El-Gamal encryption scheme. The plaintext space P = {0, 1}. In order to encrypt a bit b, the sender does the following: If b = 0, then choose uniformly y subset Z_p and compute c_1 = g^y (mod p) and c_2 = h^y (mod p). The ciphertext is (c_1, c_2). If b = 1, then choose uniformly and independently y, z subset Z_p, and compute c_1 = g^y (mod p) and c_2 = g^z (mod p). The ciphertext is (c_1, c_2). Show that it is possible to decrypt correctly and efficiently given the knowledge of a. But you don't need to proof this