Duration: 4:44

53 views

0

\( 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 \) - contains exactly two elements is
(a) \( 9 \times{ }^{n} C_{2} \)
(b) \( 3^{n}-{ }^{n} C_{2} \)
- (c) \( 2 \times{ }^{n} C_{n} \)
(d) \( { }^{n} C_{2} \cdot 3^{n-2} \)
W
📲PW App Link - https://bit.ly/YTAI_PWAP
🌐PW Website - https://www.pw.live