'A' is a set containing n elements. A subset 'P' of 'A' is chosen. The set 'A' is reconstructed by replacing the elements. A subset 'Q' is again chosen.
Now...
33Q1. the total no of ways to choose 'P' and 'Q'.....
Q.2 such that P intersection Q is null set.
Q.3 such that P is subset of Q.
Q.4 such that P intersection Q is null set and P union Q is set A
Q.5 P intersection Q contains exactly one element.
Q.6 P intersection Q contains exactly two element.
Q.7 P union Q has all elements of A except 1.
33Q.8 P union Q has has exactly two elements of A
Q.9 P and Q has same no of elements
Q.10 no of elements in P is more than Q.
Q.11 no of elements in P is exactly one more than Q.
626) no of ways to select 2 elements = nc2
remaining n-2 elements are either in P only or Q only or neither:
So it is 3n-2
So it should be 3n-2. nc2
33all frm 1-4 are correct try others........ if u solved 1-4 u can solve others may be explanation for Q.6 will give u a hint....