Introduction to algorithm Third edition

2. (Exercise 6.5-8 in the textbook) The operation Heap-Delete(A,i) deletes the item at index i from heap A, and ensures that A retains heap structure. Give a pseudocode implementation of Heap-Delete the runs on O(lg n) time for an n-element max-heap. Give a single sentence explanation for why your implementation runs in O(Ig n) time. This may look similar to Heap-Extract-Max, but make sure your code can handle both of the following scenarios correctly: 9 Delete this node 1 6 9 Delete this node