A common cryptographical tool is the use of XOR. XOR the following binary values:
10110001
00111010

A.
10001011

B.
11011000

C.
10011101

D.
10111100

Explanation:
The XOR gate is a digital logic gate that implements an exclusive or; that is, a true output (1/HIGH) results if
one, and only one, of the inputs to the gate is true. If both inputs are false (0/LOW) or both are true, a false
output results. XOR represents the inequality function, i.e., the output is true if the inputs are not alike otherwise
the output is false. A way to remember XOR is “one or the other but not both”.
https://en.wikipedia.org/wiki/XOR_gate