Suppose you are doing RSA encryption with p = 101, q = 113, and e = 3.
(a) Find the decryption exponent d. (Hint: Although there are methodical ways to do this, trial and error is efficient for e = 3.)
(b) Encrypt the message m = 9876. Note that evaluating m3 with 32-bit arithmetic results in overflow.