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 $,$qlarr$=3,(A,p,r)xlarrA[r]ilarrp-1$plarrpr$-1A[j]x,$ilarri$+1A[i]harrA[j]A[i+1]harrA|r|i+1A=[11,10,3,9,26,24,27,12](A,1,8)p$

$,$qlarr PARTITION$(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]harrA|r|$