Give the order of growth (as a function of N using big oh) of the running times of each of the following code fragments:

a. int sum = 0; for (int n=N; n >0; n=2) for(int i=0; i<>