undefined

Partial Question 4 6/ 10 pts Matching A function f(n) is of lower order than g(n) if f(n) O(g(n)) In other words, f(n) is of lower order than g(n) if g(n) is an asymptotic upper bound to f(n). Match the following functions based on their order. Assign the number 1 to the function with the lowest order. Assign the same number to functions with the same order. 5000000lg(Ig(n)) 1 5000lg(n) 2 10Square Root (n) 4 0.001n 3 Ign)^2 5 Partial Question 5 6 / 10 pts Matching A function f(n) is of lower order than g(n) if f(n) E O (g(n)) In other words, f(n) is of lower order than g(n) if g(n) is an asymptotic upper bound to f(n). Match the following functions based on their order. Assign the number 1 to the function with the lowest order. Assign the same number to functions with the same order. 5000000lg(Ig(n)) 1 5000lg(n) 2 10Square Root (n) 3 0.001n^(1+0.1) 4 v nlg(n) 5