Dry run quick sort algorithm on following data (use standard partition function), Show different stages of sorting process using trees or using array so that array contents and changes are visible. Data: {3,1, 5, 6, 8, 26, 4,3 6, 46, 9}

function Partition (A, 1,r) Procedure QuickSort (A,l,r) repeat if (r>) then partition (A,l, QuickSort (A,I.j-1); QuickSort (A,j+1,r); r); repeat i = i + l ; until (a[ i] >-v) or (i > n); repeat j-j-; until (ajlor(2) if (ij) then swap (a[ i , aljD until j-i end of if. return (j)