$c_k=a_{k}OR{b}_k$

for each $k=1,2,$dots, Here, XOR is the bitwise exclusive or operation. For example, all this means that if the original fille is $01100110.$ then A stores $0101$ and $B$ stores $1010$ and C stores $1111$ Make sure you understand this example, If not, you are not understanding this question and cannot answer it correctly.

a$)(2$ points$)$ Assume that after the data has been written to drives $A.$ and $C$ as explained above, drive $\frac{?}{{?}_{?}}$ is destroyed Only drives $E$ and C are left. Explain how each bit a$,$ can be reconstructed from the knowledge of $b,$ and o$.$ Your explanation must binspecific and detellec. It is insufficien: to declare that $2$ can be reconstructed from $E$ and $C$ or such

$11$ Explain in Each case how a$.$ can be reconstructed a on crive C had been written according to ${}_n=A,$AND s$.$ for