Consider the bit strings $A=001100$ and $B=010101$ then $A\vee B`= ? $ ($B`=$bitwise NOT)
First I wrote $B`$ and get,
$$B`= 101010$$
then I took first "$0$" of $A$ and "$1$" of $B`$ then get (1),
$$A\vee B`= (001100)\vee(101010) = (101110)$$
But this is accepted wrong. What am I missing? Can't we negate $B$ in bit operation like this?
This was a multiple choice question and answers were like these
A-)001000 B-)011101 C-)101110 D-)010001