QuickSort$(A,p,r$

if $q=$Partition$(A,p,r)A,p,rx=A[r]i=p-1r-1(A[j]x)i=i+1A[i]A[j]A[i+1]A[r]A,1,12A=\{13,19,9,5,12,8,7,4,21,2,6,11\}AA[1]=13p$

$q=$Partition$(A,p,r)$

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

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

Partition$(A,p,r)$

$x=A[r]$;

$i=p-1$

for $(j=ptor-1)$

$if(A[j]x)$

$i=i+1$

exchange $A[i]$ with $A[j]$

exchange $A[i+1]$ with $A[r]$;

return $i+1$;

Suppose you run Partition$(A,1,12)on$ the array $A=\{13,19,9,5,12,8,7,4,21,2,6,11\},$ what value will $be$ returned?

Please note that the index $of$ the first element $in$ array $Ais1.(i.e.A[1]=13)$