Consider a message space M = {0, 1}P , where P is bit-length of each message m M. e.g. , P is 5 for message 10110. The key space K is also P -bit strings, but the number of 1s for each key k is less than 50%. e.g. , 11000 K, 11100 / K. The cipher text c is computed by k x (one time pad). Is this system secure? please explain why this system is (not) secure.