Heap Sort Tutorial how to use this in C, C , Java and Python

7. (10 points) Give a pseudocode of Heap-sort. For simplicity, you can assume that the heapA you're given is already a max-heap. You can use the function MAX-HEAPIFY(i) as a sub-procedure. Recall that the function MAX-HEAPIFY(i) makes the subtree rooted at node i amax-heap, if both the left and right subtrees of node i are max-heaps. You can use A.heapsizeto denote the current heap size. If you can't give a pseudocode, you can describe the Heap-sortalgorithm in words, but you will lose some poin