Let us assume algorithm-1 runs in

T_(1)(n)=(1)/(2)n^(2)

steps, algorithm- 2 takes

T_(2)(n)=6nlogn+6n

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)

Let us assume algorithm- 1 runs in T1(n)=21n2 steps, algorithm- 2 takes T2(n)=6nlogn+6n steps for input of size n. For what values of n (mention the interval) does algorithm-2 performs better than algorithm-1. (10 pt)