[Solved] Heapsort0 Consider Following Max Heap 15 109 8 7 2 135 Using Heapsort Heap Result List As Q37218458

. HeapSort0. Consider the following max-heap: 15 109 8 7 2 135 (a) Will using HeapSort ) on the above heap result in a list in ascending (small to large) or descending (large to small) order? Circle one: ascending descending (b) Justify your answer to part (a) by explaining how the first iteration of the HeapSort algorithm would be applied to the given heap, and how your answer will eventually result. 15 10 9 8 7 2 1 3 5 4 Show transcribed image text . HeapSort0. Consider the following max-heap: 15 109 8 7 2 135 (a) Will using HeapSort ) on the above heap result in a list in ascending (small to large) or descending (large to small) order? Circle one: ascending descending (b) Justify your answer to part (a) by explaining how the first iteration of the HeapSort algorithm would be applied to the given heap, and how your answer will eventually result. 15 10 9 8 7 2 1 3 5 4

Expert Answer

---

Answer to . HeapSort0. Consider the following max-heap: 15 109 8 7 2 135 (a) Will using Heapsort ) on the above heap result in a l… . . .