3. The function f(x) = n + n2 + 2" + nbelongs in which of the following complexity categories why? (d) 0(nlgn) (a) (n) (e) O(n) (b) 0(m2) (e) (n) (f) None of these 4. Suppose you have a computer that requires 5 minutes to solve problem instance of size 220 What instance sizes can be run in 5 minutes on a computer 16 times faster than the first one assuming the following complexities? (n) I ((log2 n)?) (2) (n)