The Boolean expression is equivalent to:
We have to simplify the statement
First recall the basic implication law:
Before using the law, it is convenient to tidy up the right-hand conjunction. Because conjunction is both commutative and associative, we may rearrange the factors freely:
So the whole expression becomes
Now set Applying the implication law we obtain
Next, use De Morgan’s rule for the negation of a conjunction:
Substituting this result we have
The disjunction symbol “∨” is associative, so we can write the whole thing as
To see the final simplification clearly, break the analysis into the two possible truth-values of .
Case 1: is false. If is false, then is true, and the entire disjunction is automatically true. Therefore the expression is true irrespective of and .
Case 2: is true. If is true, the term becomes false, and the disjunction reduces to
Factor out of the second term:
Hence, when is true, the original statement is equivalent to . Remembering that itself is true in this case, (The factor can be inserted because is already true and therefore has the same truth value as .)
Combining both cases, we can write the simplified form valid for all truth-values of as
Finally recognise this again as an implication, with antecedent and consequent :
Thus the original Boolean expression is logically equivalent to
Comparing with the given options, this matches Option C.
Hence, the correct answer is Option C.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.