The Team Picking problem is: Given a set of n players, {pi,P2.. .Pn), and a list of pairs of players who don't like each other and a number k n, is it possible to pick k players for a team such that every player geta along with every other player on the team.? (a) Prove that the Team Picking problem is in NP. (b) Prove that the Independent Set problem reduces to the Team Picking problem in polynomial time Note that proving a) and b) proves that the Team Picking Problem is NP-complete.)