(a) Using RSA, choose p = 3 and q = 11, and encode the word "dog" by encrypting each letter separately. Apply the decryption algorithm to the encrypted version to recover the original plaintext message.
(b) Repeat part (a) but now encrypt "dog" as one message m.