Assuming a binary heap is arranged for efficient removal of the largest item, what is the running time to find the largest element but not remove it (like the stack method top) ? a) 8(1) b) 8(lo92 n) c) 8(n) d) 8(n2)

Assuming a binary heap is arranged for efficient removal of the maximum item, what is the running time to remove the maximum element and maintain the heap property? a) 8(1) b) 8(lo92 n) c) 8(n) d) 8(n2)