1.4 (8 points) Design a data structure D which supports the following operations: 1 Marimum(D): return the element in D with the largest key 2 Insert(D, x): insert the key a into the data structure D, and update the data structure ac- cordingly 3 Extract Max(D): find and delete the largest key in D, and update the data structure accordingly All of these operations should run in at most O(log n) time in the worst case, where n is the total number of data elements in the data structure. What data structure will you use? Briefly explain your answer L