Write the status of the list F= (12,2,16, 30,8,28,4,10,20,6,18) at the end of each phase of recursive Quick sort using median of three rule to determine the pivot key. (20 points)

Show that recursive QuickSort takes O(n²) time when input list is already in sorted order(20 points)

Write a non recursive version of Quicksort incorporating the median of three rule to determine the pivot key. You can use the F array above from a) for your testing. (40 points)

Show that the non recursive version of Quicksort above takes O( n logn) time on already sorted list. (20 points)