Let $A$ be a set of $n$ elements. The number of ways, we can choose an ordered pair $(B, C)$, where $B$, $C$ are disjoint subsets of $A$, equals
(A) $n^2$ (B) $n^3$ (C) $2^n$ (D) $3^n$
Doubt 1: What is a disjoint subset ?
My Attempt at the above problem: Assume 5 elements. Ordered pairs would be: $$(1,1),(1,2),(1,3),(1,4),(1,5),(2,1),(2,2),(2,3),(2,4),(2,5),(3,1),(3,2),(3,3),(3,4),(3,5),(4,1),(4,2),(4,3),(4,4),(4,5),(5,1),(5,2),(5,3),(5,4),(5,5)$$
25 elements. So, the answer would be: (A) $n^2$.
Is this the right approach ? Any better ways to solve this ?