Show by induction that for all n = 2,3,. ON n Recall that k Question 2: [2.1] Determine all the partitions of the set {a,b,c}. [2.2] Given that the Stirling set number {*} is defined as the number of ways to partition a set of n objects into exactly k nonempty subsets. Use the above to determine - END - mation 1/1 ← G O157 %- 2:11 PM Search the web and Windows )) we have > { 2 } = 2²-1 is the Stirling set number for n and k. Ö - 1. Links