Question 5 8 pts Select the best answer The objective of this exercise is to identify a function among 4 different functions a(n), b[n) cn), and din) using the growth of rate. a(n) = 3.n, bn) = 1000.n. c) = 1,000,000 In(n).d(n) = 0.001n3 The graph below is a hint about two functions f(n) and f(n). We do not know the range or the x-axis values. Iffyin) - a(n) then f (n)-[name1] -f(n) - f(n) din bin dini None of these answers Question 6 8 pts Select the best answer. The objective of this exercise is to identify a function among 4 different functions a(n), b[n).cin), and din) using the growth of rate. a(n) - 3.n, bin) = 1000.n. c) = 1,000,000 In(n). d(n)=0.001n3 The graph below is a hint about two functions fin) and f(n). We do not know the range or the x axis values. Iffin) = b[n) then fin) = [name] - f(n) - f.(n) bin) Question 7 8 pts Select the best answer. The objective of this exercise is to identify a function arrong 4 different functions an), bin), cn), and d(n) using the growth of rate. a) - 1.1", b{n) - 1000.n,c(n) - 1,000,000 In(n), d{n) - 0.001n The graph below is a hint about two functions fin) and f(n). We do not know the range or the x axis values. If f(n) = a[n) then fi(n) = [name 1). -f(n) L (n) None of these answers aln) bin cm) Question 8 8 pts Select the best answer. Let the function fin) defined as: f(n) = 1,000,000n 100+ 0.000000001(1.2)"+ 1,000,000 f(n) grows as [name 1] (1.2) 100 Constant 1.000.000 Question 9 18 pts Provide a numerical value. The objective of this exercise is to find the largest input size N that an algorithm A with time complexity fin) can handle in one year. We assume that fin) is expressed in milliseconds. Ifnen'.then Algorithm A can handle in one year a problem of size n up to