In a tennis tournament, each player wins k hundreds of dollars, where k is the number of people in the subtournament won by the player (the subsection of the tournament including the player, the player’s victims, and their victims, and so forth; a player who loses in the first round gets $100). If the tournament has n contestants, where n is a power of 2, find and solve a recurrence relation for the total prize money in the tournament.