Problem
Although it is correct to use a "reverse" comparator with the priority queue ADT so that we retrieve and remove an entry with the maximum key each time, it is confusing to have an entry with maximum key returned by a method named "removeMin." Write a short adapter class that can take any priority queue P and an associated comparator C and implement a priority queue that concentrates on the element with maximum key, using methods with names like removeMax.