CONCEPT EXERCISES 3.2 Study the following algorithm: i = 0; while (la [i].equals (element)) i++; Assume that a is an array of n elements and that there is at least one index k ino... n-1 such that a [k).equals (element). Use Big-O notation to estimate worstTime(n). In plain English, estimate worstTime(n). 3.4 For each of the following functions f, where n= 0, 1, 2, 3, ..., estimate f using Big-O notation and plain English: a. f(n) = (2+ n) (3 + log(n)) b. f(n) = 11 * log(n) + n2 - 3452 c. f(n) = 1+ 2+ 3+ ... + n d. f(n) = n* (3 + n) - 7*n e f(n) = 7' n+ (n-1) * log(n-4) f. f(n) = log (+)+n (n + 1) * log(n+ 1) - (n + 1) + 1 g. f(n) = n h. f(n) = n+1/2+/4+1/8 + 1/16 + ...

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;>;>;>;>