Question 1: Prove by induction that for every n >= 3, any set of cardinality n has exactly n(n-1)(n-2)/6 subsets of cardinality
Question 2: You can use the fact that there are exactly n(n-1)/2 subsets of cardinality
You need to satisfy the requirements specific in the instruction.