$.$ Given the array A $=3,6,1,5,8,2,4,1,3.$ Demonstrate the step$-$by$-$step process of applying $7\mathrm{.}1$ Description of quicksort

$($a$)$

$($b$)$

$($c$)$

$($d$)$

$($e$)$

$($f$)$

$($g$)$

$($h$)$

$($i$)$

partition using the last element of the array as pivot, i$.$e$.,$ A$[9]=3.$ Illustrate each step,

including the partitioning of the array, following the approach shown in Figure $7\mathrm{.}1$ of the

textbook. List the indices of i and j at each step. Present the two subarrays partitioned from

the given array.