Could you please show me the step by step of the quicksort algorithm

Using Quick Sort, with the median pivot rule (pick the median of: data[lo], data[hi 1], and data[(hi + lo) / 2]), sort the following list of numbers. Show your work by drawing the tree of partitions and pivots (as seen on the slides) with the partition rules discussed in class (swapping the pivot to index lo and doing swaps to complete the partitions). Apply a cutoff of 3 elements and sort with any sorting method.