The Boolean Expression is equivalent to
We have to simplify the Boolean expression and compare the result with the four alternatives.
Because the (OR) and (AND) operations are both commutative and associative, we may rearrange the terms without changing the value. Thus we write
Now notice the presence of the term by itself and the compound term The absorption law of Boolean algebra states that
Here, let us set and Applying the absorption law, we obtain
Substituting this result back into the full expression gives
At this stage, only two terms remain. To proceed further we invoke the distributive law, which in Boolean form states
Assigning we have
The expression is always true (a tautology), because either is true or is true. In Boolean algebra, a tautology is represented by . Therefore,
Since the OR operation is commutative, Hence the completely simplified form of the original expression is
Looking at the options provided, this matches Option A.
Hence, the correct answer is Option A.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.