Asymtotic Notation

a. Consider the following Code-segment:

for(i=1; i < N * N * N;i+++)

for(j=0; j< N * N;j+++)

x+= 1;

What can you say about the running time for this code segment in terms of Big-Oh? be sure to justify your asnwer.

Please explain in detail.

b.Count the operations for the following code sgment and then determine the big-oh in terms of the input size N.

line 1 sum = 0;

line 2 for(i = 0; i * i < N;i++)

line 3 for(j = 0;j * j < N;j++)

line 4 sum++;

line 5 for(k = 0; k < N; k++)

line 6 sum++;

please explain in detail.