I need help understanding how the heap sort traces the following array of numbers.

Build the heap from the numbers in the following list. How many exchanges were required? How many comparisons? 55 50 10 40 80 90 60 100 70 80 20 50 22 Shrink the heap from the above to create the array in sorted order. How many exchanges were required? How many comparisons? Build the heap from the numbers in the following list. How many exchanges were required? How many comparisons? 55 50 10 40 80 90 60 100 70 80 20 50 22 Shrink the heap from the above to create the array in sorted order. How many exchanges were required? How many comparisons