Question 9 1 pts Suppose we have the following graph of two functions f(n) and g(n). fin) g) Select all of the statements which are true. O f(n) = O(g(n)) Og(n) = N(f(n)) Of(n) = 1 (g(n)) og(n) = 0 (f(n)) Question 1 1 pts The most common variable used when stating an algorithms complexity is n. For instance, you can say an algorithm has O(n) or O(n log n). What does n commonly represent? O output size number of operations O problem size O number of lines of code Question 2 1 pts If you determine that an algorithm has a runtime of O (14,500) then it has an order of magnitude O (1). O True False Question 3 1 pts Select all that apply. Why is algorithm analysis important in software development? Effort spent trying to improve algorithms that are already efficient is not wasted, since if an improvement is found, the improved algorithm can be stored and reused later. Sometimes it is necessary to optimize an algorithm even to gain a small improvement in the running time Some inefficient algorithms may not be able to solve problems beyond a trivial size in a reasonable amount of time At the current state of computer hardware, algorithm analysis is no longer necessary, since even inefficient algorithms can be executed in reasonable amounts of time