In the actual construction of DES, the two halves of the output of the final round of the Feistel network are swapped. That is$,$ if the output of the final round is $($L$16,$ R$16)$ then the output of the cipher is in fact $($R$16,$ L$16).$ Show that the only difference between the computation of DESk and DES$1$ k $($given the swapping of halves$)$ is the order of sub$-$keys.