1. Design and write an appropriate function called SwapMaxValues that takes
   as input parameters a vector and a list (in that order) and swaps the two
   largest values in the two containers, assuming both containers contain the
   same kind of values and the "largest value" makes sense. In each case, if
   the maximum value occurs more than once in the container, it is the first
   of the occurrences that is swapped. Neither the list nor the vector should
   be altered except for the new value in each case. Hint: Because the kinds
   of values in the containers may vary from one call of the function to the
   next, in this case an "appropriate" function will, of course, be a template
   function.

2. Place this function in a separate file called SwapMaxValues.hpp and
   #include this file into your test driver for the function.

3. When you have tested the function to the point where you are happy with it,
   copy just the function file (SwapMaxValues.hpp) to your K:drive.