In how many ways can we select two disjoint subsets from a set of $n$ elements.
We denote $A$ and $B$ as two disjoint sets. For each element, it can either belong to $A$, $B$, or neither $A$ nor $B$. Therefore, there are $3^{n}$ possible configurations.