We need to find how many choices for Δ∈{∧,∨,⇒,⇔} make (pΔq)⇒((pΔ∼q)∨((∼p)Δq)) a tautology.
Recall that P⇒Q is false only when P is true and Q is false. So the expression is a tautology if whenever (pΔq) is true, at least one of (pΔ∼q) or (∼pΔq) is also true.
Case 1: Δ=∧ (AND)
(p∧q)⇒((p∧∼q)∨(∼p∧q))
When p=T,q=T: LHS = T. RHS = (T∧F)∨(F∧T)=F∨F=F.
So the implication is F. Not a tautology.
Case 2: Δ=∨ (OR)
(p∨q)⇒((p∨∼q)∨(∼p∨q))
RHS: (p∨∼q)∨(∼p∨q)=(p∨∼p)∨(q∨∼q)=T∨T=T.
Since RHS is always T, the implication is always T. Tautology.
Case 3: Δ=⇒ (Implication)
(p⇒q)⇒((p⇒∼q)∨(∼p⇒q))
(∼p⇒q) is equivalent to (p∨q). This is false only when p=F,q=F.
When p=F,q=F: LHS = (F⇒F)=T. RHS = (F⇒T)∨(T⇒F)=T∨F=T.
When p=T,q=T: LHS = T. RHS = (T⇒F)∨(F⇒T)=F∨T=T.
When p=T,q=F: LHS = F. So implication is T.
When p=F,q=T: LHS = T. RHS = (F⇒F)∨(T⇒T)=T∨T=T.
All cases give T. Tautology.
Case 4: Δ=⇔ (Biconditional)
(p⇔q)⇒((p⇔∼q)∨(∼p⇔q))
Note: (p⇔∼q)=∼(p⇔q) and (∼p⇔q)=∼(p⇔q).
So RHS = ∼(p⇔q)∨∼(p⇔q)=∼(p⇔q).
The expression becomes: (p⇔q)⇒∼(p⇔q).
When p=T,q=T: (T)⇒(F)=F. Not a tautology.
Therefore, exactly 2 choices (∨ and ⇒) make the expression a tautology.
The answer is Option B: 2.