1. Illustrate the operation of HEAPSORT on the array A = < 1, 5, 2, 6, 3, 8, 4, 9, 7 >. Show the tree after the BUILD-MAX-HEAP call, and after each call of MAX-HEAPIFY.

2. Let A [1..n] be a max-heap with n distinct elements, where n > 1. Let i be a number between 1 and n, 1 i n. Write the pseudocode for an algorithm HEAP-SUBTREE-MIN(i,n) which returns the minimum element in the subtree rooted at the node i. What is the RT of your algorithm?