Key idea: Translate r into p and q, then compare the truth tables.
- "x is rational" is ∼p. So r≡(∼p↔q).
- ∼p↔q is true exactly when p and q have different truth values. So r≡p⊕q (exclusive or) ≡ ∼(p↔q).
- Statement-2: ∼(p↔∼q). Since p↔∼q is true exactly when p,q differ, ∼(p↔∼q) is true exactly when p,q are the same, i.e. it is p↔q. This is the negation of r, so Statement-2 is false.
- Check: p=T, q=F gives r=T but ∼(p↔∼q)=∼(T)=F.
- Statement-1: "r is equivalent to either q or p". Read as an exclusive "either…or", this is exactly p⊕q, which matches r. So Statement-1 is true.
Answer: (D) Statement-1 is true, Statement-2 is false