We need to determine which of the given statements is a tautology (always true regardless of truth values of p and q).
Recall that A⇒B is equivalent to ∼A∨B.
q⇒(∼p∨q)≡∼q∨(∼p∨q)≡∼p∨(∼q∨q)≡∼p∨T≡T
Since ∼q∨q is always true (law of excluded middle), the entire expression simplifies to True. This is a tautology.
Option A: (∼p∨q)⇒p≡∼(∼p∨q)∨p≡(p∧∼q)∨p≡p. This is not a tautology (false when p=F).
Option B: p⇒(∼p∨q)≡∼p∨(∼p∨q)≡∼p∨q. This is not a tautology (false when p=T,q=F).
Option C: (∼p∨q)⇒q≡∼(∼p∨q)∨q≡(p∧∼q)∨q≡(p∨q)∧(∼q∨q)≡p∨q. This is not a tautology (false when p=F,q=F).
The tautology is q⇒(∼p∨q), which corresponds to Option D.