1. Iterate through the input list and use a hash map to count the votes for each player. 2. Define a comparator for the Player class that orders players as described above. Namely, a player with a higher count precedes a player with a lower count, and two players with the same count are ordered alphabetically by name. 3. Construct a priority queue of players using the comparator defined in Step 2. 4. Iterate through the entry set of the hash map. For each map entry (i. e. key-value pair) construct a Player object and add it to the priority queue. 5. Remove players from the priority queue until it is empty.