please answer all question . thank you .

1. This problem provides a numerical example of encryption using a one-round version of DES. Let us start with the same bit pattern for the key K and the plaintext, namely: a. Derive K1, the first-round subkey. b. Derive L0,R0. c. Expand R0 to get E[R0], where E[.]istheexpansionfunctionofTableS.1. d. Calculate A=E[R0] XOR K1. e. Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding S-box substitutions. f. Concatenate the results of (e) to get a 32-bit result, B. g. Apply the permutation to get P(B). h. Calculate R1=P(B) XOR L0. i. Write down the ciphertext