Suppose you have an integer array A with N elements $($A is global$).$ The following

function select$\_$sort sorts A using the selection sort algorithm. Convert the following to

Pseudo$-$C code with $($un$)$conditional gotos in place of the for and if statements.void select$\_$sort $($int N$)\{$

int $i,j,$min,max,$tmp$;

for $(i=0$; $i\frac{N}{2}$; $i++)\{$

min$=i$;

max$=i$;

for max$=$jmin$=jtmp=A[i]$;$A[i]=A[min]A[min]=$tmpA$[N-1-i]=A[max]$;$A[max]=(A[j]\{$

min$=j$;

$\}$

$\}$

$tmp=A[i]$;

$A[i]=A[min]$;

$A[min]=tmp$;

$tmp=A[N-1-i]$;

$A[N-1-i]=A[max]$;

$A[max]=tmp$;

$(j=i+1$;$j$

$if(A[j]>A[max])\{$

max$=j$;

continue;

$\}$

$if(A[j]\{$

min$=j$;

$\}$

$\}$

$tmp=A[i]$;

$A[i]=A[min]$;

$A[min]=tmp$;

$tmp=A[N-1-i]$;

$A[N-1-i]=A[max]$;

$A[max]=tmp$;

$\}$

$2.$ Convert the Pseudo$-$C code from part $1$ into MIPS.

# $t$0,$ $t$1,$ $s$0,$ $s$1,$ $t$9$ for int i$,$ j$,$ min, max,tmp;

loop:

loop$2$:

chkmin:

chkmax:

next:

#swap variables

#i$++$

exit: