Let us assume algorithm$-1$ runs in Ti$($n$)0\mathrm{.}5$n$^2$ steps, algorithm$-2$ takes T$2($n$)=6$nlogn $+6$n steps for a input of size n$.$ For what values of n $($mention the interval$)$ does algorithm$-2$ performs better than algorithm$-1.(10$ pt$)$