A card game tournament is being played by a large number of players. Each game involves two playersthe winner earns one point, the loser forfeits a point (deducted), and if the game is drawn, neither players point score changes. Each player plays several games with other players. New players may join the tournament as they wish, and players may leave at any time. It is required to maintain a log of all players at any time, along with their current point tally in one or more data structures. A players point tally may be updated (increased or decreased) at any time, players may be added or removed at any time, and the top four players need to be identified at any time.

What data structure(s) would you use to maintain the players records? Describe how you would carry out the required operations, along with the running time (big O) of each.