Explain and draw merge sort , quick sort, and heap sort for the following list.

{150,40,170,50,160,28,10,195}

#8150 40 170 50 160 28 10 195 a) Use Mergesort to sort the following list. (Hint: Use the algorithm 2.4, p.62) Show the action steps Give the tree recursive calls b) Use Quicksort to sort the following list. Show the action steps. (Hint: Use algorithm 2.6, p.65) Show the action steps Give the tree recursive calls c) Use Heapsort to sort the following list. Show the action steps. Show the action steps Give the tree recursive calls (Maxheap)