3.10. A decryption exponent for an RSA public key (N, e) is an integer d with the property that ade ≡ a (mod N) for all integers a that are relatively prime to N. (a) Suppose that Eve has a magic box that creates decryption exponents for (N, e) for a fixed modulus N and for a large number of different encryption exponents e. Explain how Eve can use her magic boxHoffstein, Jeffrey. An Introduction to Mathematical Cryptography (Undergraduate Texts in Mathematics) (p. 182). Springer New York. Kindle Edition.