Part 1

Follow the steps shown in the video to illustrate (draw) the operation of heap sort on the array A {5, 13, 2, 25, 7, 17, 20, 8}.

Show your work. You may use Word or a drawing program of your choice.

Part 2

Conduct a comparison analysis of the quicksort and mergesort.

Find the best case, worst case, and average case in time and space complexity for each sort.

Explain why quicksort is preferred for arrays and mergesort for linked lists?