Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. (You will not need all...

Extracted text: Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. (You will not need all the columns; Coloring is not required) 56 40 36 21 35 22 25