Figure $1$: A min$-$max heap.

Using an array to represent the min$-$max heap structure $($in the same way as for min heap or max heap$),$ implement the following operations.

$1.$ buildHeap: Builds a min$-$max heap from a list of naturals read from standard input.

$2.$ findMin and findMax: Returns the minimum $($resp the maximum$)$ element.

$3.$ insertHeap: Inserts a new element into the min$-$max heap.

$4.$ deleteMin and deleteMax: Deletes the minimum $($resp the maximum$)$ element.