Suppose alice uses rsa to send the same messagex(e. g., her credit card num-ber), encrypted, to three companies, all of which use the easy choice ofe= 3in their public key. eve intercepts these encrypted messages, i. e.,x3(modn1),x3(modn2), andx3(modn3), wheren1,n2, andn3are the moduli used inthe companies public keys (all greater thanx). there is a method (the chi-nese remainder theorem) by which eve can use these to deduce the value ofx3(modn1n2n3). assuming this can be done, explain how eve can now computexexactly. [note: this is one reason whye= 3 is a poor choice in practice.](b) a popular choice foreis 65537. what is special about this value ofe(as opposed to nearby values) that makes it a good choice?