Q3: [Marks 2] The operation heap_delete (A, i) deletes the value at node i from a max-heap A. Give a pseudocode for heap delete that runs in O(log n) time for an n-element max-heap. An elegant solution will always reuse the procedures available and build on top of them rather than providing a new solution altogether