Please write clearly and legibly so I may understand the process. Thank you.

Problem 2: Consider the following simplified version of the CFB mode. The plaintext is broken into 32-bit pieces: P-[P1, P2,...], where each Pi has 32 bits, rather than 8 bits used in CFB. Encryption proceeds as follows. An initial 64-bit Xi is chosen. Then for j-1,2,..., the following is performed where L32(X) denotes the 32 leftmost bits of X, Rs2(X denotes the 32 rightmost bits of X, and XoY denotes the string obtained by writing X followed by Y (a) Find the decryption algorithm (b) The ciphertext consists of 32-bit blocks C1, C2, .. Suppose that a transmission error causes C1 to be received as Ci C1, but that C2, Cs.. are received correctly. This corrupted ciphertext is then decrypted to yield plaintext blocks P, P. . . .. Show that P P, but that P-P for all i > 4. (Therefore, the error affects no more than three blocks of the decryption.)