Suppose that you use the following encryption scheme: each bit in the key R (a sequence of bits) is XORed with its corresponding bit in the plaintext M in order to get the ciphertext. This simple scheme can be written as C=M XOR R. You want to use this scheme to encrypt your messages, where the language used for the messages has only two words represented as binary: A-111 and B-000. For example, a message M could be "000111111000" but it can never be "010101" 1. You have two messages, M1 and M2. You generated two keys R1 and R2. Unfortunately, R1-R2. You apply the encryption scheme mentioned above and get two ciphertexts, C1 and C2. C1 = 011101101001000111001 Please identify a pair of plaintexts, M1 and M2, which yield C1 and C2. And justify your solution