1. 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.

2.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 for your testing

Both in c++ code