In the Diffie$-$Hellman protocol, each participant selects a secret number x and sends the other participant $\backslash$alpha x mod q for some public number $\backslash$alpha $.$ What would happen if the participants sent each other x$\backslash$alpha or some public number $\backslash$alpha instead? Give at least one method Alice and Bob could use to agree on a key. Can an adversary break your system without finding the secret numbers? Can an adversary find the secret numbers?