Calculate the time complexity of each algorithm by how many times Statement$()$ will get called. Use Big O notation to express your answer.

$1.$ k$=0$;

while $($k$^2<$ n$)\{$

Statement$()$

k$+=1$

$\}$

$2.$ for $($k $=1$; k $<=$ n; k $*=2)\{$

for $($int m $=1$; m $<=$ k; m$++)\{$

Statement$()\}$

$\}$

$3.$ for $($a $=1$; a$<=$ n; a$++)\{$

for $($b $=1$; b$<=$a; b$++)\{$

for $($c $=1$; c$<=$a; c$++)\{$

Statement$()\}$

$\}$

$\}$