A min-max heap is a data structure that supports both deleteMin and deleteMax in O (logN) 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 element 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 element stored at X is larger than the parent but smaller than the grandparent. See Figure below, which is a Min-Max Heap. A) How do we find the minimum and maximum elements? B) Give an algorithm in pseudocode to insert new node into the min-max heap