Sort the following array of integers. 3 4 5 1 7 2 6 Use heapsort in-place. Follow the example of Figure 8.9 on p. 352 of the text, showing the full array and a tree diagram of the heap at each step: before heap creation begins, after each key is added during heap creation, and after each iteration of the loop in the second phase (converting the heap to a sorted array as in parts f-j of the same figure). (10 points) Using the above data, show the state of the array just after the initial partitioning of quicksort, before the two recursive calls are done. Clearly show the boundaries of the two partitions. (5 points)