Given an array of numbers A={7,2,3,5, 1, 6, 12, 18,4}. Answer the following questions using algorithms given below: (a) Build the array into a max-heap, following the build-max-heap algorithm. Show each intermediate step and the binary tree representation of your final result. BUILD-MAX-HEAP(A) A. heap-size = A. length for i = LAmh_down to 1 de MAX-HEAPIFYA, 1) MAX-HEAPIFY (A, 11 1 = LEFT) r = RIGHT() ifs A. heap-size and A[4] >A[ largest - else largest ai ifrs A. heap-size and A[r] > A[largest] largest er if largest i exchange A[n] and A[largest] MAX-HEAPIFYA, largest)