Problem
1. What is the minimum number of keys that must be moved during a "remove the largest" operation in a heap? Draw a heap of size 15 for which the minimum is achieved.
2. Write a program to delete the element at position d in a heap.
3. Empirically compare bottom-up heap construction with top-down heap construction, by building heaps with 1000 random keys.
4. Give the contents of the q array after pq construct is used on a p array containing the keys E A S Y Q U E S T I O N.