(6) Give a combinatorial proof that k() = n2n-1 72 Itecall that a combinatorial proof requires counting a set in two different ways to achieve the two expressions in the identity. Hint: Consider all possible ways to n n people and then to select one chairperson from the committee