Question 1: For each code segment, state its worst-case runtime in terms of n using Big O notation.

a. int i, j, k = 1; for (i = n / 2; i <= n; i++) { for (j = 1; j <= n; j = j + 2) { k = k * 2; } }

Answer:

b. int a = 0, b = 0; for (i = 0; i < n; i++) { a = a + 1; } for (j = 0; j < a; j++) { b = b + 1; }

Answer:

c. total = 0; i=1; while (i < n){ for(j=1; j < n; j++) total = total + 1; i= 2*i; }

Answer:

d. sum = 0; for(i=0; i < 2*n; i++) for(j=i; j

Answer: