Due Date: November 30

NO LATE SUBMISSIONS.

Prompt the user for a name of a file that contains entries of the form

firstName  lastName  goals  assists  points
(The types are apstring, apstring, int, int, int)

Each line in the file is representing a player.
Define a new struct named Player that can be used to
store the information for each player.

Read the entries in the file into an apvector<Player>,
resizing the apvector as appropriate.

Output the entries in decreasing sorted order of points.
If there is a tie, use the player with the most goals.
If there is still a tie, use the alphabetically earlier last name.
If there is still a tie, use the alphabetically earlier first name.
Define a function IsOrdered to incorporate this ordering information:
    bool IsOrdered( const Player & p1, const Player & p2 );

Sort the apvector, by modifying the sorting algorithm, and using
calls to IsOrdered instead of the < function.

HAND IN: Your source code and program output.
  Use the file data9.txt, which will be on the Web page.

The due date is Monday, November 30 at CLASS TIME.