Give a combinatorial proof for the following identity. For 0≤k≤n, k( n k ​ )=n( n−1 k−1 ​ ) (Hint: Consider answering the following question in 2 different ways. How many ways can we create a size k committee of students from a class of n students, where one of the committee members is designated as chair?)