A is a set containing n elements. A subset P1 of A is chosen. The set A is reconstructed by replacing all the elements of P1. Next, a subset P2 of A is chosen and again reconstructed by replacing all the elements of P2. In this way, m>1 subsets P1,P2,P3,⋯,Pm of A are chosen. The number of ways of choosing P1,P2,P3⋯,Pm is

A is a set containing n elements. A subset P1 of A is chosen. The set

1.	A is a set containing n elements. A subset P1 of A is chosen. The set A is reconstructed by replacing all the elements of P1. Next, a subset P2 of A is chosen and again reconstructed by replacing all the elements of P2. In this way, m>1 subsets P1,P2,P3,⋯,Pm of A are chosen. The number of ways of choosing P1,P2,P3⋯,Pm is
Answer» $A$ is a set containing $n$ elements. A subset $P_{1}$ of $A$ is chosen. The set $A$ is reconstructed by replacing all the elements of $P_{1}$ . Next, a subset $P_{2}$ of $A$ is chosen and again reconstructed by replacing all the elements of $P_{2}$ . In this way, $m > 1$ subsets $P_{1}, P_{2}, P_{3}, \dots, P_{m}$ of $A$ are chosen. The number of ways of choosing $P_{1}, P_{2}, P_{3} \dots, P_{m}$ is