Please justify yours answers

i) (10 points) The following is the Heapsort(A) algorithm: HEAPSORT(A) 1 BUILD-MAX-HEAP(A) 2 fori A.length downto 2 3 exchange All] with Ali] 4 A.heap-size- A.heap-size -1 5 MAX-HEAPIFY (A, 1) Rewrite Heapsort(A) using the procedures Build-Min-Heap(A) and Min-Heapify(A.i) you designed. Your Heapsort(A) algorithm must produce the same result: a sorted array A in increasing order. k) (5 points) Analyze the time and space complexity of your Heapsort(A) algorithm