Implement Diffie Hellman key exchange between two parties, Amelia and Ben, where they are working with a public prime $p=71,$ with public generator $g=7.($While $71$ isn't particularly large, pretend it is$.$ It is a fact that the smallest positive generator $($primitive root$)$ mod $71$ is $7..)$ So you act as Amelia, and pick a random number namelia. And you will act as Ben, and pick a random number $n_{\text{B}\text{E}\text{N}}.$ Then you will find the secret key $($which you can imagine is like a secret session key$).$ So based on your choices for random integers nAMELIA and $n_{\text{B}\text{E}\text{N}},$ what was the secret session key Amelia and Ben have agreed upon?