P is a set containing n elements.a subset A is elected at random.The set P is reconstructed by replacing its elements.A subset B of P is again selected at random
the no of ways of selecting subsets A and B such that A(union)B is equal to P
Once again, you should understand that this is not a homework service nor is it a tutorial service. PLease either post some of your own work on this problem or explain what you do not understand about the question.