Give an analysis of the running time as Big-Oh: A. sum = 0; for (i = 0; i

What are the complexities of the following code segments in terms of n? Give an upper bound. a) int i=1;while (i<= n) {     int j = i;   while (j > 0)       j = j/2;i++; } b) int i,j s=0;                                                                             for (i=0; i<n; i++) {      i--;   s++;   if (s == n) { i++;     s = 0;   } }   c) while (n > 0) {   for (int i=0; i<n; i++)                                                     sum++;   n = n/2; }