Public Key Cryptography

The teacher assigns Alice and Bob the task to execute a run of the Diffie$-$Hellman protocol

with $=2$ and $q=11.$ After a while, Alice utters $"10"$ and Bob replies with $"7".$

Can you infer the secret number shared by Alice and Bob as a result of the execution of the

protocol?

You can find it helpful the following $($partial$)$ tabulation of the function $f(x,y)=x^y$mod$11$ :