Suppose that instead of using a composite N = pq in the RSA cryptosystem, we simply use a prime modulus p. As in RSA, we would have an encryption exponent e, and the encryption of a message m mod p would be me mod p. Prove that this new cryptosystem is not secure, by giving an efcient algorithm to decrypt: that is, an algorithm that given p, e, and me mod p as input, computes m mod p. Justify the correctness and analyze the running time of your decryption algorithm.