1. A group of n = 2k people enter a 2-on-2 basketball competition. Before the competition starts, the players are split up into teams of 2. This amounts to partitioning a set A = { A1, A2, . . ., Ax} such that |All = ... = \\Ax| = 2. Can you find a rule for the number of potential team combinations by looking at the first few cases of n? 10 marks