Identify a tight upper bound for the running time of the following code. static int sum(int n) { int sum = 0; while (n >= 2) { sum++; n = n/2; } return sum; } O a. O(n) O b. None of the others O c. O(log n) O d. O(nlog n) O e. O(n) Of. O(n)