and pair (abis called maximum pair if it is not dominated by any other pairs we are interested in maintaining the set of maxima of collection of price-performance pairs that iswe would like to add new pairs to this collection (for examplewhen new car is introduced)and we would like to query this collection for given dollar amount to find the fastest car that costs no more than dollars we can store the set of maxima pairs in an ordered dictionarydordered by costso that the cost is the key field and performance (speedis the value field we can then implement operations add( , )which adds new cost-performance pair ( , )and best( )which returns the best pair with cost at most cas shown in code fragment code fragment the methods for maintaining set of maximaas implemented with an ordered dictionary