Question 4 Suppose that the following list was created by the function buildHeap during the heap creation phase of heapsort. 90, 80, 72, 75, 78, 60, 65, 50, 70, 71, 55, 40, 45, 61, 64 Show the resulting array after two passes of heapsort-that is, after two iterations of the outer for loop. (Draw the heap as a tree to make it easier to run the iterations) Your answer: O 40, 45, 90, 80, 72, 75, 78, 60, 65, 50, 70, 71, 55, 61, 64 O 72, 75, 78, 70, 71, 60, 65, 50, 61, 64, 55, 40, 45, 80, 90 40, 45, 78, 75, 72, 70, 71, 60, 65, 50, 61, 64, 55, 80, 90 040, 75, 72, 70, 71, 60, 65, 50, 61, 64, 55, 40, 78, 80, 90 O 78, 75, 72, 70, 71, 60, 65, 50, 61, 64, 55, 40, 45, 80, 90