Present an example of walking through the quick sort. Your example should use the revised partitioning method (median of three) when selecting the pivot value. Post the following:

State which version of quicksort you will be demonstrating.

Start with an unordered list of at least NINE elements.

List all the recursive calls that would be made to sort the list.

Show the ordering of the sublist after each recursive call returns.