Let ⊕ and ⊗ are two mathematical operators. If p ⊕ p ⊗ q is not a tautology, then ⊕ and ⊗ can be

Step-by-step solution

A p ∨ p ⇒ q is false only if p is false and p ⇒ q is false which is never possible simultaneously. Hence, p ∨ p ⇒ q is a tautology C p ⇒ p ∨ q is false only if p is true and p ∨ q is false which is never possible simultaneously. Hence, p ⇒ p ∨ q is a tautology B p ⇒ p ∧ q is false only if p is true & p ∧ q is false which is possible when p is true & q is false. Hence, p ⇒ p ∧ q is not a tautology