Let n and k be positive integers. 1.For each j between 1 and n, find a formula for the number of subsets of S={1,2,,n} of size k+1 which have j as their largest element. 2. Use you formula from #1 to give a combinatorial proof of the formula (kk)+(k+1k)++(n1k)=(nk+1)