Concept:A tautology is always true, and a contradiction is always false.
We use logical equivalences to classify each statement pattern.
Explanation:For A,
(q→p)∨(p→q) becomes
(∼q∨p)∨(∼p∨q).
This simplifies to
(p∨∼p)∨(q∨∼q), which is always true.
So A is a tautology.
For B,
(∼p∨∼q)↔∼(p∧q).
By De Morgan's law,
∼(p∧q)≡∼p∨∼q.
Both sides of the biconditional are identical, so B is always true.
Hence, B is a tautology.
For C,
[(p∨q)∧∼p]∧∼q can be rewritten as
(p∨q)∧(∼p∧∼q).
Since
∼p∧∼q≡∼(p∨q), the expression becomes
(p∨q)∧∼(p∨q), which is always false.
So C is a contradiction.
For D,
(p∧q)∧(∼p∨∼q).
Here
∼p∨∼q≡∼(p∧q).
So the expression becomes
(p∧q)∧∼(p∧q), which is always false.
Hence, D is a contradiction.
Answer:A and B are tautologies, while C and D are contradictions.
Therefore, the correct option is Option B.