An Algorithm C$1($n$)$ uses $10$nlog

$2$

$$

n operations and C$2($n$)$ uses n

$2$

$+512$ operations. Which of the following values for n

$0$

$$

is the smallest such that C$2($n$)>=$C$1($n$)$ for all n$>=$n

$0$

$$

$?-64-128-16-32*$ Consider the following pseudo code: a$0$ for i$0$ to n$$n do for j$0$ to i do a$$a$+$i Which of the following characterization, in terms of n$,$ of the running time of the above code is not correct? $-\backslash$Omega $($n

$2$

$)-$ O$($n

$5$

$)-\backslash$Theta $($n

$4$

$)-$ O$($n

$3$

$)*$ Assume the Sequence ADT based on a circular array implementation. Which of the following operations requires O$($n$)$ steps? $-$ atRank $-$ replaceAtRank $-$ remove $-$ elemAtRank