Problem 3 (4 points) Heapsort (1) (2 points) Show the sorting process on the array A = using Heapsort; (2) (2 points) We can build a heap by repeatedly calling Max-Heap-Insert to insert the elements into the heap. Consider the following variation on the Build-Max-Heap procedure: Build-Max-Heap (A) 1 A.heap-size = 1 2 for i = 2 to A.length 3 Max-Heap-Insert(A, A[i]) a. Build a max-heap on the array A in (1) using Build-Max-Heap"; b. Show that in the worst case, Build-Max-Heap requires O(n Ig n) time to build an n-element heap