Sort the following array in ascending order using Quick sort

with median$-$of$-$three partitioning and a cutoff of $3.$

$6387144118-246-167-3299683712855-1276$

Your answer should show the subsets at each step of the recursion going down and the merged sets at

at each step of backtracking of the recursion, that ultimately gives the full sorted array.