b. (5pt) In the following loops, first count the number of operations (i.e., find out how many lines will be printed out) when N is 32. Then give the computational complexity using big-O notation for any value of N. (justify your answers) Number of lines printed when N-32 big-o notation int i, j, N-32; |Total lines-