$($Ch$.7)(2\mathrm{.}5$ points$)(5$ minutes$)$ Use the code below as a reference when answering questions related to Quicksort and Partition. Note that the index for the first element of the main array is $1$ and pivot is the last element

$....$

count $=0$

QUICKSORT$(A,p,r)$

if $,$qlarrPARTitiON$(A,p,r)=3,,(A,p,r)xlarrA[r]ilarrp-1$plarrpr$-1,A[j]$xilarri$+1A[i]harrA[j]A|i+1|i+1A=[11,10,3,9,26,24,27,12](A,1,8)A=[11,10,3,9,12,24,27,26]A=[3,9,11,10,12,24,27,26]A=[3,9,10,11,12,24,27,26]A=[3,9,10,11,12,24,26,27]p$

$,$qlarrPARTitiON$(A,p,r)$

count$++$

$If$ count $=3$ then exit

$,$ QUICKSORT$(A,p,q-1)$

$,$ QUICKSORT$(A,q+1,r)$

PARTITION $(A,p,r)$

xlarrA$[r]$

ilarrp$-1$

for plarrp $tor-1$

$,ifA[j]x$

ilarri$+1$

exchange $A[i]harrA[j]$

exchange $A|i+1|$