While studying the math course together, Alice and Bob work out some examples using an RSA modulus N that they found in their class notes. Since they feel confident with their understanding of RSA, they go back to their dorms and publish their respective RSA public keys: Alice's public key is (N,eA=35) and Bob's public key is (N,eB=23). Imagine now that their friend Charlie sends the same secret message m to both Alice and Bob using RSA encryption and their respective public keys. Suppose Eve intercepts the two different encryptions cA (for Alice) and cB (for Bob) of the common message m. Assuming that Eve has noticed that both Alice and Bob are using the same modulus N , how can Eve find m? You may assume that gcd(m,N)=1.