6.15 A min-max heap is a data structure that supports both delete min and delete max in Olog n) per operation. The structure is identical to a binary heap, but the heap order property is that for any node, X, at even depth, the key stored at X is smaller than the parent but larger than the grandparent (where this makes sense), and for any node X at odd depth, the key stored at X is larger than the parent but smaller than the grandparent. See Figure 6.56. a. How do we find the minimum and maximum elements? *b. Give an algorithm to insert a new node into the min-max hean *c. Give an algorithm to perform delete min and delete max "d. Can you build a min-max heap in linear time? *c. Suppose we would like to support delete min, delete max, and merge. Propose a data structure to support all operations in O(log n) time