Consider the following implementation of partition from the quicksort algorithm that was covered in lecture. Note that the last element in the array is chosen as the pivot.

int partition$($int a$[],$ int left, int right$)\{$

int pivot $=--$right;

while $($true$)\{$

while $($a$[$left$]<$ a$[$pivot$])$

$++$left;

while $($left $<$ right && a$[$right $-1]>=$ a$[$pivot$])$

$--$right;

if $($left $>=$ right$)$

break;

swap$($a$[$left$],$ a$[$right $-1])$;

$\}$

swap$($a$[$left$],$ a$[$pivot$])$;

return left;

$\}$

Suppose that you had the following unsorted array:

int$[]$ arr $=\{88,34,77,20,53,45,12,76,29,61\}$;

What are the contents of this array after$$one call to partition$($arr$,0,10)?$