For each of the following code segments, estimate worstTime(n) using Big-O notation or plain English. In each segment, S represents a sequence of statements in which there are no n-dependent loops. a. for (int i = 0; i * i < n; i++) S b. for (int i = 0; Math.sqrt (i) < n; i++) S c. int k = 1; for (int i = 0; i < n; i++) k *= 2; for (int i = 0; i < k; i++) S Hint: In each case, 2 is part of the answer.