*Draw the tree representation of the array shown in column t of Figure 8.14.

*Show the changes made to the tree drawn in the previous exercise in order to sort the remaining four integers (7, 3, 2, and 1) using the Heap Sort.

*Show the changes to the array of integers shown in column s of Figure 8.14 that reflect the changes to the trees drawn in the previous exercise. Produce a table similar to the one shown in Figure 8.14.

Index Pass 1 Pass 2 Pass 3 Pass 4 Pass 5 0 1007736 36 2223 23 19 1922 1717 2 27 9 919 19 9 19 19 19 17172333 3 433333333333 3 333 217 5 2525 25 257 7 77 2 222 21919 19 919 1919 62525 25 2525 25 25 25 25 25 25 71 22 2 2 2 36 36 36 36 36 36 36 36 36 36 36 36 36 36 36 181 7 100|100|100 100|100|100|100|100|100 100|100|100|100 | 100 | 100 | 100 | 100 | 100 | 100 alb df E Prst