Problem 3 (10 points, 5 points each part): Use heapsort to sort the following arrays. For your submission, show your work by displaying the contents of the array and the resulting heap at each step. You do not need show the steps involved in "heapifying" the array, but should mention when it is occurring. a. [6, 4, 2, 3, 8, 7, 1, 9, 5] b. [2,9,6, 7, 1, 3, 4, 5, 8]