6. (50 points) HeapSort and running time analysis: (1) Using the example covered in class as a model, illustrate the operation of HeapSort on the array A = [12, 5, 33, 10, 25, 7, 4, 17, 9, 28]. - (2) Show that the worst-case running time of HeapSort is (n lgn).