Consider the one time pad encryption scheme for binary strings of length 3. This is defined as follows: Gen: k< (0,1)3 Enc(k, m1 m2 m3): For i in 1 to 3: cm, k₁ = m, +k, mod 2 (where k, is the ith bit of k). Dec(k, C1C2C3): For i in 1 to 3: m₁ = c, k = c +k, mod 2 (where k, is the ith bit of k).

(a) For ciphertext = 101, list out all key / message pairs, (k, m), such that Enc(k, m) = c

(b) what is Pr [Enc(k,111)=101]?

K < {0,1}³