EXERCISE 4.26. To speed up RSA encryption, one may choose a very small encryption exponent. This exercise develops a "small encryption exponent attack' on RSA. Suppose Bob, Bill, and Betty have RSA public keys with moduli ni, n2. and n3, and all three use encryption exponent 3. Assume that nis pairwise relatively prime. Suppose that Alice sends an encryption of the same message to Bob, Bill, and Betty_that is, Alice encodes her message as an integer a, with 0