what is the best, worse, and average time complexity? Explain why for each.

public static void selectionSort$($int$[]$ arr$)\{$

$$ int n $=$ arr.length;

$$ for $($int i $=0$; i $<$ n $-1$; i$++)\{$

$$ System.out.print$($arr$[$i$]+"$:$\backslash$t $")$;

$$ int min$\_$idx $=$ i;

$$ for $($int j $=$ i $+1$; j $<$ n; j$++)\{$

$$ System.out.print$($arr$[$j$]+",")$;

$$ if $($arr$[$j$]<$ arr$[$min$\_$idx$])\{$

$$ min$\_$idx $=$ j;

$\}$

$\}$

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

$$ arr$[$i$]=$ arr$[$min$\_$idx$]$;

$$ arr$[$min$\_$idx$]=$ temp;

$$ System.out.println$()$;

$\}$

$\}$