. Suppose that a plaintext message P is not relatively prime to n = pq; where p and q are large primes Is it possible to successfully decrypt the ciphertext produced by encrypting P using RSA cryptosystem. with key (e; n)?