Given an array of wrapped Integer objects with the values listed below, execute the first (complete - pivot selection and all swaps) pass of a Quicksort using Median-of-Three Partitioning.  Be explicit in showing (and labeling) each step (pivot selection, partitioning, pivot replacement.)  Clearly label the state of the array at the end of the pass.  Disregard the cutoff and the use of insertion sort, as this exercise has been kept small for your convenience.  Show the algorithm, no code required nor desired.

 

Integer [] arrayToSort = { 55, 62, 24, 75, 33, 11, 44, 81, 37, 99, 7, 40, 63, 15, 23 };