A is a set containing n elements. A subset P of A is chosen. The set A reconstructeed by replacing the elements of P. A subset Q of A is again chosen. The number of ways of chosen P and Q so that `PnnQ=phi` is _____________.

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 of A is again chosen. i) The number of ways of choosing P and Q so that PcapQ=phi is

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 choosing P and Q so that P cap Q = phi is :

A is a set containing n different 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 choosing P and Q so that PnnQ contains exactly two elements is a. .^n C_3xx2^n b. .^n C_2xx3^(n-2) c. 3^(n-1) d. none of these

A is a set containing n different 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 choosing P and Q so that PnnQ contains exactly two elements is a. .^n C_3xx2^n b. .^n C_2xx3^(n-2) c. 3^(n-1) d. none of these

A is a set containing n different 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 choosing P and Q so that PnnQ contains exactly two elements is a. .^n C_3xx2^n b. .^n C_2xx3^(n-2) c. 3^(n-1) d. none of these

A is a set containing n different 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 choosing P and Q so that PnnQ contains exactly two elements is (a). .^n C_3xx2^n (b). .^n C_2xx3^(n-2) (c). 3^(n-1) (d). none of these

A is a set containing n different 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 choosing P and Q so that P nn Q contains exactly two elements is a.^(n)C_(3)xx2^(n) b.^(n)C_(2)xx3^(n-2) c.3^(n-1) d.none of these

A is a set containing n different 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 choosing P and Q so that P nn Q contains exactly two elements is a.^(n)C_(3)xx2^(n) b.^(n)C_(2)xx3^(n-2) c.3^(n-1) d.none of these

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 of A is again chosen. Find the number of ways of choosing P and Q, so that (i) P capQ contains exactly r elements. (ii) PcapQ contains exactly 2 elements. (iii) P cap Q=phi