Problem 4: (5 + 2 points) Design an algorithm that takes n = 2k-1 as an input and produces a schedule of a round-robin tournament for teams with numbers 1, 2k-1 in 2k-1 days such that team with number i does not play a game on the day number i for every i. The complexity of the algorithm has to be O(n2)