Option (A) is correct.
Step 1: rewrite the condition. By the counting rule for a union,
n(A∪B)=n(A)+n(B)−n(A∩B)
so
n(A∪B)−n(A∩B)=n(A)+n(B)−2n(A∩B)
The term 2n(A∩B) is always even. So the difference is even exactly when n(A)+n(B) is even, that is, when n(A) and n(B) are both even or both odd.
Step 2: the three properties.
- Reflexive: n(A∪A)−n(A∩A)=n(A)−n(A)=0, which is even.
- Symmetric: A∪B=B∪A and A∩B=B∩A, so the condition does not depend on the order.
- Transitive: if n(A), n(B) have the same parity and n(B), n(C) have the same parity, then n(A) and n(C) have the same parity.
So R is an equivalence relation.
Step 3: the classes. P(X) has 8 subsets. Sorting them by the parity of their size:
- even size: ∅, {1,2}, {1,3}, {2,3};
- odd size: {1}, {2}, {3}, {1,2,3}.
That is 2 classes of 4 subsets each.
Step 4: count the pairs. Inside a class of 4 subsets, every ordered pair is in R, giving 42=16 pairs. Pairs from different classes are not in R. So
∣R∣=16+16=32
out of the 82=64 ordered pairs of P(X)×P(X).

Why the other options are wrong
- (B) The pair count is right, but R is transitive: it only compares the parity of n(A) and n(B), and "same parity" passes along a chain.
- (C) This groups panels by their exact size, giving 1+9+9+1=20 pairs. But {1} and {1,2,3} are related although their sizes differ: n(∪)−n(∩)=3−1=2, which is even.
- (D) 64 pairs would make R universal. But ∅ and {1} are not related: n(∪)−n(∩)=1−0=1, which is odd.