Modify the selection sort done in the lab and have it doing the sorting with $1$ recursive call, not two. That is$,$ one recursive call will have to be replaced by a loop.

Draw a diagram for the function calls of the selection sort with the $2$ recursive calls in it as implemented in the lab. You haye to shoy allyariables all functioncalls, The array to

sort is $\{10,1,20,3\}$ Jpload a Word document

public class SelectionSort$81$

public static void selection$($int$[]$ ac$)1$

for $($int j $=0$; g$|$eRgth; $++$ j$)$

for $($int j $=$ j $+1$;j$$ &b$|$ergth $-1$; $++$j$)$

if $($ac$[$i$]>$ a$[[])\backslash \backslash$

int temp $=$ ar$[$i$]$;

a$[[]]=$p$[[]$;

g$[$j$]=$ temp; $\}$t $\backslash$

public static void SelectigoSertB $[$int$[])$ ar$,$ int j$,$ int $j_{\frac{?}{?}}{4}_{?}$

SelectionSertB$($ar$.j,++j$ :

if

SelactionSertB$($ar $++$ j$.$j$)$i$])$

public static void printAcraxRegursixely$($int$[]$ as$,$ int index$)\{$My concern$\}$

public static void main$($String$[]$ args$)$ &

int $[gc]=\{8,2,1,1,7,4,-1,50,49\}$ :

selectigoSertR$($ar$,0,0)$;