We first count the number of ordered pairs of disjoint subsets of S. For each element of S, we can choose to put it in either set A, set B, or neither (but not both), so we are making a sequence of 4 elements with 3 options each time. There are thus 3^4 different sequences of
choices, and each results in a distinct ordered pair of subsets.
As it is unordered pair- so we dont have to worry about the order. Hence,
If A and B are distinct, there are exactly two ordered pairs, (A,B) and (B,A), for
each unordered pair, otherwise there is just one. Given that A and B are disjoint
the only case where they are identical is when they are both empty. Thus there
are (3^4-1)/2 + 1 unordered pairs of disjoint subsets of S.
The answer = 41
Thanks
Bharat Bajaj
IIT Delhi
askiitians faculty
