We need to find Δ∈{∧,∨,⇒,⇔} such that (p∧q)Δ((p∨q)⇒q) is a tautology.
Evaluate both components for all truth value combinations:
Let X=p∧q and Y=(p∨q)⇒q.
Case 1: p=T,q=T: X=T, p∨q=T, Y=T⇒T=T. So TΔT.
Case 2: p=T,q=F: X=F, p∨q=T, Y=T⇒F=F. So FΔF.
Case 3: p=F,q=T: X=F, p∨q=T, Y=T⇒T=T. So FΔT.
Case 4: p=F,q=F: X=F, p∨q=F, Y=F⇒F=T. So FΔT.
For a tautology, all four cases must give True:
From Case 1: TΔT=T — true for all four connectives.
From Case 2: FΔF=T — checking: ∧: F, ∨: F, ⇒: T, ⇔: T. Only ⇒ and ⇔ work.
From Cases 3 and 4: FΔT=T — checking: ⇒: T, ⇔: F. Only ⇒ works.
Only Δ=⇒ satisfies all cases.
The answer is Option C: ⇒.