Consider a variant of the one-time pad with message space {0,1}n , where the key space is restricted to all n-bit strings with an even number of 1s. Prove that this cipher is not secure by showing an adversary whose semantic security advantage is 1.