Please, I want to solve all the paragraphs with a correct and clear solution. The solution must be in text format. Handwriting is completely rejected. I want answers, I do not want explanation.

Q3. What is the time complexity of following code: (2 Mark)

int count = 0; for (int i=0; i for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k count=count+1; }

Q5. Order the following functions by asymptotic growth rate. (2 Mark)

a) n2+2n, 210, 2n

b) 3n + 100logn, 4n, 2n

c) n2 + 10n, n3, n2logn