3.8 This problem provides a numerical example of encryption using a one-round version of DES. We start with the same bit pattern for the key K and the plaintext, namely: Hexadecimal notation: 012 3456789ABCDEF Binary notation 0000 0001 0010 0011 0100 0101 01100111 1000 1001 1010 1011 1100 1101 1110 1111 a. Derive Ki, the first-round subkey b. Derive Lo. Ro . Expand Ro to get E[Ro], where E is the expansion function of Table 3.2. d. Calculate A=E[R|KI. 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)L i. Write down the ciphertext