Suppose the sub-key generation function is to reverse all the bits of the key K (e.g., 01 1 1 -> 1 1 1 0) , and the scrambling function is f = M XOR K, where M is the second half of input bits and K is the sub-key (i.e., the reverse of the original key K). Now given the original K = 0011, and input bits 1111 0000, compute the output of the Feistel Cipher.