The options for each question are:-

Problem 3 10 points possible (graded) For each of the following expressions, select the order of growth class that best describes it from the following list 0(1), O(log(n)), O(n), O(n log(n), O(ne) or O(c"). Assume c is some constant. Clicking Check will grade ALL the sub-problems. You have 2 attempts for this problem. 1.0.0000001n +1000000 Select an option 2. 0.000 1n2 + 20000n-90000 Select an option+ 3.20n 900 log(n) 100000 Select an option+ 4. (log(n))2 +5n Select an option 5. 7 200-2n30 ' n200-2, 30 Select an option