We have to simplify the Boolean expression ((p∧q)∨(p∨∼q))∧(∼p∧∼q). Throughout, we shall use the well-known Boolean identities: (i) Absorption Law X∨(X∧Y)=X, (ii) Distributive Law A∧(B∨C)=(A∧B)∨(A∧C), (iii) Idempotent Law Z∧Z=Z, and (iv) the fact that any statement conjoined with its negation is false, R∧(∼R)=0.
First concentrate on the part (p∧q)∨(p∨∼q). In order to apply the absorption law, we re-express (p∧q) in a form that visibly contains (p∨∼q). Observe that
(p∨∼q)∧q=(p∧q)∨(∼q∧q).
Because ∼q∧q=0, the right-hand side reduces to p∧q. Thus we have shown
p∧q=(p∨∼q)∧q.
Letting X=(p∨∼q)andY=q, we may rewrite the first bracket as (X∧Y)∨X. Now, by the absorption law, (X∧Y)∨X=X. Therefore
(p∧q)∨(p∨∼q)=p∨∼q.
Substituting this back, the whole expression becomes
(p∨∼q)∧(∼p∧∼q).
Using associativity and commutativity of ∧, we group as
(∼p∧∼q)∧(p∨∼q).
Now apply the distributive law with A=(∼p∧∼q),B=p,C=∼q:
(∼p∧∼q∧p)∨(∼p∧∼q∧∼q).
Simplify each part step by step. In the first term, ∼p∧p=0, so
∼p∧∼q∧p=0∧∼q=0.
In the second term, the idempotent law gives ∼q∧∼q=∼q, therefore
∼p∧∼q∧∼q=∼p∧∼q.
Hence the entire expression reduces to
0∨(∼p∧∼q)=∼p∧∼q.
Thus the simplified (and therefore equivalent) Boolean expression is (∼p)∧(∼q). This matches Option B.
Hence, the correct answer is Option B.