Let N-pq be a product of two distinct primes. Show that if ?(N) and N are known, then it is possible to compute p and q in polynomial time. Hint: Derive a quadratic equation (over the integers) in the unknown p