3 One-Time-Pad (OTP) Cipher The One-Time-Pad cipher is an encryption scheme which works as follows. For any fixed parameter n, the key space of this encryption is K = {0,1)", so key k is a random bitstring of length n. The message space M and the ciphertert space C are also both 10, 1]n. The encryption E and decryption D algorithms are as follows. where operation a b for a, b E {0,1)" is defined as bit-wise xor of the bits of a and b, i.e. if a = (an-1 alao)2 and b = (bn-1 bibo)2, then ab = c (cn-1 cla)2 st. ci-ai bi for i = 0, , n-1. I. Does D(k, E(k,m)) = m for all k E K and m e M? Argue why or why not. 2. Is OTP perfectly secret for the above K, M,C? Argue why or why not