$($e$)$ In a large RSA public$-$key crypto$-$system, what is the risk if Alice chooses the plaintext

$x$ which is not relatively prime with $n?$ Propose an efficient way that the attacker may

apply for finding the private exponent.