We need to find the ordered pair (∗,⊙) from {∧,∨} such that (p∗q)⊙(p⊙∼q) is a tautology.
Step 1: Test each option systematically.
Option B: (∗,⊙)=(∨,∨)
The expression becomes: (p∨q)∨(p∨∼q)
=p∨q∨p∨∼q
=p∨(q∨∼q)
=p∨T
=T
This is a tautology.
Step 2: Verify that other options are not tautologies.
Option A: (∗,⊙)=(∨,∧)
(p∨q)∧(p∧∼q)
When p=F,q=T: (F∨T)∧(F∧F)=T∧F=F. Not a tautology.
Option C: (∗,⊙)=(∧,∧)
(p∧q)∧(p∧∼q)
=p∧(q∧∼q)=p∧F=F. Not a tautology (always false).
Option D: (∗,⊙)=(∧,∨)
(p∧q)∨(p∨∼q)
When p=F,q=T: (F∧T)∨(F∨F)=F∨F=F. Not a tautology.
Only Option B gives a tautology.
The correct answer is Option B: (∨,∨)