Sort 3, 5, 1, 2, 5, 9, 2, 7, 4, 3, 4 using Quicksort with median-of-three partitioning with 3 cutoff. (Just show the steps, not code)

Assume that the three candidate elements are not pre-sorted when selecting the pivot, but that the pivot is moved to the end in each step.