Need help with these 3 computer science question. Please show work. Please answer the programming question(3) in C++.

1 Growth of Functions (50 points) For each of the following pair of functions f(n) and g(n), decide if f(n) (g(n), or g(n) O(f(n)), and explain (1) f(n)= 2n, g(n)= nlogn (2) f(n)=Vn, g(n) = (log n)2 (3) f(n)= nd, g(n)- (4) f(n) n3 +2n2 + 10n, g(n)-100n2 (5) f(n)= (log n)3+5 log n, g(n)= n 2 Solving Recurrence by Induction (20 points) Let T(n) be defined recursively as rin)-(TTI"-1) (n > 1) (n 1) Show by induction that T(n) 7