The integers 65, 80, 70, 18, 86, 6, and 37 are stored sequentially in an array with 65 stored in element 0, and 37 stored in element 6. The Reheap Downward algorithm is used to arrange the integers into a heap. Trace the execution of the algorithm by drawing a sequence of trees similar to the ones depicted in Figure 8.11. In your figures, shade the elements being compared.

Figure 8.11

After that, show the changes to the array discussed above in a table similar to the one shown in Figure 8.12.

Figure 8.12