14. Let (n, e) be Alice's public key. Bob sends the ciphertext C using Alice's public key (n, e) for the plaintext M:= HILBERT. Show how Alice decrypts it via the Chinese Remainder Theorem to speed up...

i need detailed step by step answer. Also please don't copy the answer from other online sites

Extracted text: 14. Let (n, e) be Alice's public key. Bob sends the ciphertext C using Alice's public key (n, e) for the plaintext M:= HILBERT. Show how Alice decrypts it via the Chinese Remainder Theorem to speed up the decryption process. You must use your own moduli with an encryption key e coprime to (n) and the corresponding decryption key d.