1. (10 points) Warm Up For each of the functions given below, indicate the tightest upper-bound possible. (a) f(n) = ? (b) f(n) = (5n)2 100 +5.34? (c) f(n) = n?? (d) Is (3)" = 0(2")? (e) What is the worst-case time complexity of accessing the ith element in a linked list of n elements? (f) What is the worst-case time complexity of accessing the ith element in an array of n elements? (g) Give a precise definition of f = 9)