$(3$ points$)$ What is so special about defining OTP using the XOR operation? Suppose we

use the and operation $($which we will write as $$&$)$ and define a variant of OTP as follows:

Is it still a good choice for encryption? Why$/$Why not?

xi $($plaintext$)$ ki $($key$)$ Ci$=$ xi $+$ ki mod $2($Ciphertext$)$

$000$

$011$

$101$

$110$