Problem $2.$ You and Bob are trying to have a secret conversation, so you decide to use the following

encryption scheme. You and Bob agree on the public key $p=8191$ and $g=6.$ Your

secret key is $n=9$ and you tell Bob that $g^n-=2766(modp),$ and Bob tells you that

$g^m-=1291(modp).$ Compute the secret key $s=g^{nm}(modp)$ that you and Bob share

to decrypt your conversation.