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, namely: Hexadecimal notation: 0 1 2 3 4 5 6 7 8 9 A B C D E F
Binary notation: 0000 0001 0010 0011 0100 0101 0110 0111
1000 1001 1010 1011 1100 1101 1110 1111

Derive K1, the first-round sub-key. You need to do the following steps
`Perform the Permuted Choice One (PC-1) in Table 3.4(a) to reduce the key from 64 bits to 56 bits.
`Apply the Left Circular Shift (Please refer Table 3.4(d) for the schedule of left shifts)
`Apply the Permuted Choice Two (PC-2) to derive K1.

Derive L0 and R0.

Expand R0 to get E[R0] (which is 48 bits), where is the expansion permutation of Table 3.2(c).

Calculate A = E[R0] ⊕ K1.

Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding S-box substitutions. Make sure to use the corresponding S-box in Table 3.3 for each set of 6 bits.

Concatenate the results of (e) to get a 32-bit result,

Apply the permutation in Table 3.2(d) to get P(B).

Calculate R1 = P(B) ⊕ L0.

Write down the ciphertext L1 and R1 in binary format and hexadecimal format.