MCQ
Let $A = \left\{ {{a_1},\,{a_2},\,{a_3}.....} \right\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of it is formed independently. The number of ways in which subsets can be formed such that $(P-Q)$ contains exactly $2$ elements, is
- A${}^n{C_2}\ {2^{n - 2}}$
- ✓${}^n{C_2}\ {3^{n - 2}}$
- C${}^n{C_2}\ {2^n}$
- DNone of these