For the code segment below estimate the time-complexity in the big-oh notation.

for (int i=0; i< n; i++)

for (int j=0; j*j

System.out.println (i+j+k);

For the following functions that represent the run-time complexities of algorithms, obtain the asymptotics in big-Oh notation:

F(n)=(10+2n)(n²+nlog³n)

F(n)=n^0.5+log¹⁰n+log log n