(10 pts) For each of the following program fragments, give an analysis of the running time (using Big-Theta) '0 count = 0; x = 1; while ( x lt; N *...

•     For each of the following program fragments, give an analysis of the running time (using Big-Theta)

(10 pts) For each of the following program fragments, give an analysis of the running time (usingBig-Theta) '0 count = 0; x = 1; while ( x < N * N J {x *= 2; count++; } ii) count = 0; x = 1;while ( x < N * N J {x += 2;count++;}finsum = 0,for( j = 0; j < N * N; i¢$ )for(;,=0,§v<j*j;}v++)sum++,(iflwe:while {;<N){a=a+mfor ($3; j = a; j < N: j ++Jif (j > i} for ($3; k = 0; k < N*N; k++} sum++;