Assume that we tried to simplify the RSA cryptosystem by making use of just a prime p in place of the composite modulus N = pq. As in RSA, we could have an encryption exponent e which is relatively prime to p − 1, and encryption of message x would be x e mod p. Show that this scheme is not secure by offering an efficient algorithm that, given p, e and x e mod p, determines x mod p. Be sure to justify correctness and analyze the running time of your algorithm.