Question 7: Your favourite battle royal game is having a tournament. Each game is played with 5 players. Each game played returns exactly 1 winner who moves on to the next round in the tournament. The tournament starts with n players, where n is power of 5. The subroutine PLAYGAME(Players[i, i + 5]) takes 5 players from the set of Players and has them play each other to determine the winner. Determine the number of games played in the tournament. That is, determine the number of times PLAYGAME(Players[i, i + 5]) is called as a function of n. Be sure to justify your answer. Notes: for i in range(0, n, 5) has i take on values from 0 to n - 1 in increments of 5. Algorithm TOURNAMENT(Players, n): if n = 1: return; Winners = ; for i in range(0, n, 5): Winner = PLAYGAME(Players[i : i + 5]); Winners.APPEND(Winner); TOURNAMENT(Winners, n/5)