Analyse the running time of the following algorithms asymptotically, (in Big-O), by showing the time complexity of each statement. (1) i =1) x++; i

Analyse the running time of the following algorithms asymptotically, (in Big-O), by showing the time complexity of each statement.

(1) i <---n;

while(i>=1)

x++;

i<--- (squareroot i );

(2) i<---n;

while(i<=n)

x++;

i<---i+10;

(3) i<---n;

while(i<=n)

x++;

i<--- i * i;