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