(15 pоints) Find а seriоus mistаke in the fоllowing "proof" thаt hardness of Discrete Log (DL) problem in some known group implies hardness of the Computational Diffie-Hellman (CDH) problem in that group. A couple of sentences should be enough for the solution here. "Proof": For any efficient DL adversary we construct an efficient CDH adversary . Adversary Run on When returns , return Analyzing the above construction we see that because the simulation is perfect, i.e., 's view in the experiment simulated by is exactly like in its DL experiment; and wins whenever wins. This is because if and , and if is correct in outputting , then returns , as it should. Clearly, is efficient whenever is efficient, it just does one extra exponentiation in the group, which is polynomial. Hence,