$1.$ In the Chaum$-$Evertse$-$Van de Graaf$-$Peralta zero$-$knowledge proof for discrete log possession, imagine that: i$)$ you are the prover; ii$)$ you do not actually know the logarithm x; iii$)$ but you know somehow from the very beginning that the challenge to be chosen by the verifier will be c $=1.$ How could you cheat the verifier by giving correct answers in the protocol $($so that he believes you know x$)?$