In the same manner as we generated a tree per step of build_max_heap in Lecture 8 (see slide 4.17), draw trees for each of the steps that build_max_heap will take to turn5,3,17,10,80,18,7,21,8. Here's the mentioned slide for your convenience: A=[4,2,1,6,7,9,11,5,3,8] 4 4 11 2 11 8 11 6 8 9 1 6 7 9 (1) 6 7) 4 1 (5) 3 (3) (5) (3) 2 (5) 3 (2) build_max_heap(A) : for i in range (heap_size //2,1,1) : max_heapify (A,i, heap_size=heap_size) A=[4,2,1,6,7,9,11,5,3,8]