please write solutions clearly and if you could explain please. thanks

5. For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) nanoseconds. 1 sec 1 min 1 hour 1 day 1 year logn vn nlogn 2" 6. Determine whether each of these functions is o(x), (x), or 2(x). a) f(x)=17X+11 b) f(x)= xlogx c) f(x)=2* d) f(x)=x*/2 e) f(x)= x + 1000 7. For each of the following pseudo codes find the complexity of the algorithm in big O notation. Explain your findings. a) int sum = 0; for (int i = 0; i<>