Let sn, k denote the number of ways to partition an n-element set into exactly k nonempty subsets. the order of the subsets is not taken into account. (the numbers sn, k are called stirling numbers of the second kind.) show that sn, n-1- c(n, 2) for all n 2.