(b) (7 points) For a given input array A: < 1, 2, 5, 3, 4, 7, 6, 9, 8 >, what is the sequence of numbers in A after calling Build-Max-Heap(A)? Please show the intermediate trees. Algorithm 2 Build-Max-Heap(A) - 1: heap size[A] < length[A] 2: for length [A]/2] downto 1 do 3: MaxHeapify(A, i) 4: end for