Problem
1. (a) Design a function that will delete the entry with the largest key (the root) from the top of the heap and restore the heap properties of the resulting, smaller list.
(b) Analyze the time and space requirements of your function.
2. (a) Design a function that will delete the entry with index i from a heap and restore the heap properties of the resulting, smaller list.
(b) Analyze the time and space requirements of your function.
3. Consider a heap of n keys, with xk being the key in position k (in the contiguous representation) for 0 ≤ k.