PART $8[15$ marks$]$ Data Structures $/$ Algorithms

$[2]$ Assume Quick Sort algorithm is used to sort the following array in ascending order $($low to high$)$:

This algorithm uses the first element, here $50,$ as the Pivot, to move the elements around for the resulting

array to be split into two subarrays for subsequent recursive calls. What is the correct result after the first

pass of Quick Sort?