Suppose Bob's encryption company produces two machines, A and B, both of this are supposed to be implemen-
tations of RSA using the same modulus n = pq for some unknown primes p and q. Both machines also use the
same encryption exponent e. Each machine receives a messagemand outputs a ciphertext that is supposed to be
m^e mod n. Machine A always produces the correct output. However, machine B, because of implemetation
and hardware errors, always outputs a ciphertext c mod n such that c = m^e mod p and c = m^e + 1 mod q.
How could you use machines A and B to find p and q?