11 (Combinatorics] Prove by mathematical induction that every n-member set has 2" subsets. (Hint: In step B, when a new member is added to a k-member set, every subset of the resulting (k 1member set...

Attached

Extracted text: 11 (Combinatorics] Prove by mathematical induction that every n-member set has 2" subsets. (Hint: In step B, when a new member is added to a k-member set, every subset of the resulting (k 1member set either contains the new member, or does not contain it.)