Question: Bob has modulus n and exponent e as his RSA public key, $($e$,$n$).$ He has told Eve that she can send him any message M $<$ n and he is willing to sign it using a simple RSA signature method to compute S$=$Md modn, where d is his private RSA exponent, and he will return the signature S to Eve. Unfortunately for Bob, Eve has captured a ciphertext C that AliceBob has modulus n and exponent e as his RSA public key, $($e$,$n$).$ He has told Eve that she can send him any message M $<$ n and he is willing to sign it using a simple RSA signature method to compute S$=$