3.4 a For each of the following functions I, where n= 0, 1, 2, 3. -, estimate using Big-O notation and plain English: a. f(n) = (2+n) * (3+ log(n)) b. f(n) = 11 * log(n) + n2-3452 cf(n) = 1 + 2+ 3+ ...n d. f(n) = n(3+n) -7'n e f(n) = 7* n+ (n-1) * log(n-) 1. f(n) = log (n) + (n+1) * log(n+1) - (n+1) + 1 9. f(n) = n nefn) - n+12+1/4+18+1/16 3.6 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 non-dependent loops for (int i = 0;i'i;>;>++)>;>