To decide which given statement is a tautology, we consider every option one by one and simplify it algebraically.
First, recall the basic logical equivalence for an implication:
a→b≡∼a∨b.
We will convert each implication using this rule and then simplify.
Option A is p∨(∼q)→p∧q.
Using the implication rule we have
∼(p∨(∼q))∨(p∧q).
Apply De Morgan’s law to the negation:
∼p∧q∨p∧q.
Now take q common:
q∧(∼p∨p).
Inside the parentheses, ∼p∨p is a tautology (it is always true). Therefore the whole expression reduces to
q∧(True)=q.
This final result q is not always true (it is false when q is false), so Option A is not a tautology.
Option B is ∼(p∧∼q)→p∨q.
Convert the implication:
∼(∼(p∧∼q))∨(p∨q).
The double negation simplifies immediately:
(p∧∼q)∨p∨q.
Group the p terms:
p∨(p∧∼q)∨q.
Using the absorption law p∨(p∧r)=p, we obtain
p∨q.
The expression p∨q can be false (specifically when p and q are both false). Thus Option B is not a tautology.
Option C is ∼(p∨∼q)→p∧q.
Again convert the implication:
∼(∼(p∨∼q))∨(p∧q).
The double negation gives
(p∨∼q)∨(p∧q).
Take p common from the last two pieces:
p∨∼q∨(p∧q).
Using absorption again, p∨(p∧q)=p, so we get
p∨∼q.
This can be false whenever p is false and q is true. Hence Option C is not a tautology.
Option D is ∼(p∨∼q)→p∨q.
Convert the implication exactly as before:
∼(∼(p∨∼q))∨(p∨q).
Simplify the double negation:
(p∨∼q)∨(p∨q).
Rearrange the terms:
p∨∼q∨p∨q.
Using idempotent law p∨p=p, merge the repeated p terms:
p∨∼q∨q.
Now notice that ∼q∨q is always true (law of excluded middle), so write
p∨(True).
Finally, α∨(True)=True for any statement α. Therefore the whole expression is always true, no matter what truth-values p and q take.
Thus Option D represents a statement that is true in every possible case; that is exactly the definition of a tautology.
Hence, the correct answer is Option D.