Given an array A[1.7]=17,23,12,32,24,15,9, run Build-Max-Heap (A,7) to convert A into a max-heap. BUIL-MAX-HEAP (A,n) 1 for i=n/2 downto 1 2. MAXHEAPIFY(A,i,n) Max-HEaPIFY (A,i,n) l=LEFT(i) r=RIGHT(i) if ln and A[l]>A[i] largest =1 else largest =i if rn and A[r]>A[ largesi] iargest =r if largest =i exchange A[i] with A[largest MX-HEAPIFY (A, largest, n) (1) What will be the resultant array A after running Build-Max-Heap (A,7) on the given array A. Please write your answer as a sequence of numbers separated by ". ". For example: 1,2,3,4,5,6,7 (2) How many key comparisons were made by Build-Max-Heap (A,7) in total