n the lectures we showed that RSA encryption works, that is$,$ we showed $[\{$M$\}$Alice$]$Alice $=$ M$.$ Give the

analogous proof that RSA signature verification works, that is$,\{[$M$]$Alice$\}$Alice $=$ M