Show that if an attacker of RSA finds (n) then this attacker can calculate p and q easily. (Assume n = pq is public; recall that for two primes p and q we have (pq) = (p 1) (q 1).) (cryptography)