The correct option is C None of these
Let P has r elements. It can be chosen in nrC ways. Then Q can be chosen from remaining n−r elements in n−r0C+n−r1C+n−r2C+...n−rn−rC=2n−r ways. Thus, both P and Q can be selected in (nrC∗2n−r) ways.
Thus, the number of ways this can be done = ∑nr=0(nrC×2n−r)=(2+1)n=3n ways.
Hence, (D) is correct.