3. (25 points) Show the intermediate results of each pass of the following sorting algorithms on the initial list of numbers: 120,205,348,6,37,295,16,41,430. (a) Quick sort with median-of-three method to choose the pivot. (b) Recursive merge sort (c) Natural merge sort (d) Heap sort using max heap (e) Radix sort