Using the array A= [1 4 12 3 8 16 4 20] with n=8 elements, build the heap first and draw how the tree will look like after each of the (MaxHeapify) operation. Build MaxHeap (A, n) 1 for (i=floor (n/2); i>=1; i--) 2 MaxHeapify (A,n,i) a. After ExtractMax() b. After Insert(10) - this is called after calling ExtractMax() above