Estimate the time complexity of the following code segments, using Big$-$O notation. Briefly

explain your reasoning by indicating the number of times a loop runs.

a$.$ for $($int $i=0$; Math.sqrt $($i$)$ n; $i++)$

System.out.println $($i$)$;

b$.$ for $($int $i=0$; $i++\frac{n}{?}=2k=1i=0i++k=k***2j=0$;$ji$; $i++i$; $i++$