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 and the plaintext in hexadecimal notation 0 1 2 3 4 5 6 7 8 9 A B C D E F: a) Derive K₁, the first round sub-key. b) Derive L₀, R₀ . c) Expand R₀ to get E[R₀]. d) Calculate A= E[R₀] xor K₁. e) Group the 48-bit result of (d) into set 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 R₁=P(B) xor L₀. i) Write down the cipher text.