$6.(5\%)$ What is the time complexity of the following sorting method, if the array parameter toSort is already sorted when the method is called with toSort $=\{1,2,4,7,9\})?$ public static void sort IntArray $($int$[]$ toSort$)\{$ boolean sorted $=$ false; for$($int x $=$ toSort.length$-1$; $!$sorted && x $>0$;x$--)$ XC$18\{$ sorted$=$true; for $($int y$=0$;y $<$ x;y$++)$ if $($array$[$y$]>$ array$($y$+1])\{$ swap$($array $[$y$],$ array$[$y$+1])$; sorted$=$false; $\}$