Problem Statement Scheduling games is a little more challenging than one might desire. There are two well- known types of tournament formats that sport schedulers use: Single Elimination Tournaments e . Round Robin Tournaments Write a C++ program to help sport teams to schedule their games so that every team plays every other team as in a Round Robin Tournament. Let N = number of teams in the tournament. There will be N-1 rounds (each team will play N-1 games). To make it simpler, we assume the number of teams, N is a power of 2, so that we can use the recursion to generate the schedule for teams as shown in the following examples. Since the number of teams is even and each team will play every other team once, noIteam will be idle during any of the rounds. To display the arrangement for each team at each round, we use the following table to show the result: 2 1 N-1 N N-11 The first row displays the team number in ascending order. Starting at the second row, it displays the opponent teams at the first round for team 1 to team N respectively; at the third row, it displays the opponent teams at the second round for team 1 to team N respectively; at the K row, it displays the opponent teams at the (k-1)h round for team 1 to team N respectively, and so on. Let us schedule a round-robin tournament for 2 teams numbered from 1 to 2: The first (and only) round: team 1 against team 2. Let us schedule a round-robin tournament for 4 teams numbered from 1 to 4: 2 The first round: (1, 2) (3, 4); the second round (1,3) (2, 4); and the third round (1