Please solve with Maple

2) Suppose Bob's encryption company produces two machines, A and B, both of which are supposed to be implementations 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 message m and outputs a ciphertext that is supposed to be m (mod n). Machine A always produces the correct output. However, Machine B, because of implementation and hardware errors, always outputs a ciphertext c (mod n such that c = m (mod p) and c = m +1 (mod). How could you use machines A and B to find p and q? Demonstrate this with an example. 2) Suppose Bob's encryption company produces two machines, A and B, both of which are supposed to be implementations 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 message m and outputs a ciphertext that is supposed to be m (mod n). Machine A always produces the correct output. However, Machine B, because of implementation and hardware errors, always outputs a ciphertext c (mod n such that c = m (mod p) and c = m +1 (mod). How could you use machines A and B to find p and q? Demonstrate this with an example