Consider the following improvement to one time pad encryption, which we will call super one time pad encryption. As before our message and encryption key is a string of bits. But for super one time pad encryption we compute c = m xor k xor k where k denotes key reversal (so, for example, 11010001* = 10001011). Is super one time pad encryption perfectly secure (that is, does it leak no information about the contents of the plaintext other than the length of the plaintext)? Consider the following improvement to one time pad encryption, which we will call super one time pad encryption. As before our message and encryption key is a string of bits. But for super one time pad encryption we compute c = m xor k xor k where k denotes key reversal (so, for example, 11010001* = 10001011). Is super one time pad encryption perfectly secure (that is, does it leak no information about the contents of the plaintext other than the length of the plaintext)