A is a set containing n elements. A subset P of A is chosen. The set A is reconstructed by replacing the elements of P. A subset Q of A is again chosen. The number of ways of chosing P and Q, so that contains exactly two elements is
none of these
contains exactly two elements, taking 2 elements in (i) and (n-2) elements in (ii) or (iii) or (iv)
Study 40% syllabus and score up to 100% marks in JEE