The following heap operations involve bubble up, bubble down, or neither, or both. Match each of them with the correct entry. Return the maximum element without removing it from the heap. Insert a new element into the heap Heap Sort Build a max-heap from an unsorted array. Remove the maximum element from the heap In the lecture heap example where array indices start from 1, th of the node at i is floor(i/2). If the arfay indices were