Need this question to be done asap. Thanks for the help!

9.9 Using a spreadsheet (such as Excel) or a calculator, perform the operations described below. Document results of all intermediate modular multiplications. Determine a number of modular multiplications per each major transformation (such as encryption, decryption, primality testing, etc.).

a) Encrypt the message block M=2M=2 using RSA with the following parameters: e=23e=23 and n=233241.n=233241.

b) Compute a private key (d, p, q) corresponding to the given above public key (e, n).

c) Perform the decryption of the obtained ciphertext, without using the Chinese Remainder Theorem, and using the Chinese Remainder Theorem.