If the Boolean expression p ⊕ q ∧ ~ p ⊙ q is equivalent to p ∧ q , where ⊕ , ⊙ ∈ ∧ , ∨ , then the ordered pair ⊕ , ⊙ is

Step-by-step solution

1) p ∨ q ∧ ~ p ∧ q ≡ p ∨ q ∧ ~ p ∧ q (Using associative property) ≡ q ∧ ~ p ∧ q ≡ ~ p ∧ q 2) = p ∧ q ∧ ~ p ∧ q ≡ p ∧ ~ p ∧ q ≡ F ∧ q ≡ F 3) p ∨ q ∧ ~ p ∨ q ≡ p ∧ ~ p ∨ q ⇒ F ∨ q ≡ q 4) p ∧ q ∧ ~ p ∨ q ≡ q ∧ p ∧ ~ p ∨ q ≡ q ∧ p ∧ ~ p ∨ q (using associative property) ≡