Given a set S = {1, 2, ..., n} of players, with skill levels a1, 02, ...,an, we need to partition the set of players S into two teams Si and S2 of equal total skill. The teams do not need to be of equal size. However, every player must be in exactly one team. In other words, a Si U S2 = S Sin S2 = 0 = kesi keS2 1. Give a brute-force algorithm to solve this problem. Hint: You must be able to generate subsets of S. To do that, you can use a list of binary digits b = b1b2 ... bn where setting b = 100010 means that only players 1 and 5 are in the subset represented by b. 2. Give time complexity analysis for the worst case. Hint: How many subsets of S contain a specific element