2. Consider using One-time pad for encrypting the following three ASCII plaintexts. Each plaintext consisted of 5 characters which is 40 bits. The keys used for encrypting each plaintext is given in binary (40 bits). Spaces are added in the binary to make it easier to read. Encrypt each plaintext and find the ciphertext in ASCII. m = shiva, ki = 0001 1000 0000 1101 0001 0000 0001 0011 0000 0101 m2 = molly, k, = 0000 0110 0000 1010 0001 0101 0000 1001 0001 1101 mg = hanna, ks = 0000 0011 0000 0100 0001 0111 0000 1011 0000 0101 Think about how this affects bruteforcing the key from a given ciphertext? (no need to write about this)