The negation of the Boolean expression is equivalent to:
We are asked to find the negation of the Boolean expression and then match the simplified result with one of the given options.
First we write the required negation explicitly:
We recall De Morgan’s first law, which states that for any two propositions and , the negation of their disjunction is
In our expression, we can treat as and as . Applying the law we get
Now we turn to the second negation inside. Again, by De Morgan’s second law, which says
we let and . Thus
The double negation rule simplifies the first term, so we have
Substituting this back into the earlier expression yields
We now use the distributive law of conjunction over disjunction, namely
Here and Distributing gives
Observing that is always false (a contradiction), we replace it by the constant false value, traditionally denoted by . Since (anything) is just that “anything,” the expression simplifies to
Thus the negation of is exactly , which corresponds to Option B.
Hence, the correct answer is Option B.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.