We need to identify which Boolean expression is NOT a tautology. Recall that p⇒q≡∼p∨q.
Option A: (p⇒q)∨(∼q⇒p)≡(∼p∨q)∨(q∨p)≡(∼p∨p)∨q≡T∨q≡T. This is a tautology.
Option B: (q⇒p)∨(∼q⇒p)≡(∼q∨p)∨(q∨p)≡(∼q∨q)∨p≡T∨p≡T. This is a tautology.
Option C: (p⇒∼q)∨(∼q⇒p)≡(∼p∨∼q)∨(q∨p)≡(∼p∨p)∨(∼q∨q)≡T∨T≡T. This is a tautology.
Option D: (∼p⇒q)∨(∼q⇒p)≡(p∨q)∨(q∨p)≡p∨q. When p=F and q=F, this equals F. So this is NOT a tautology.
The answer is Option D.