suggest how you would implement a data structure that stores key,value pairs and supports the following operations with their usual meanings: insert in O(log n) time when the data structure has n elements, delete in O(log n) , and findMin, findMax in O(1) time. Notice, findMin (resp. findMax) do not remove the pair corresponding to the minimum) key, i.e., in their behaviour in different from a priority Queue data type, they just return the associated values.