Submit: eLearning Late Policy: -10 points per hour late Instructions: This is an individual assignment. Answers should be your own work. Chapter 2 6 pts 1. In the definition of Big-o, why is the "for N >= ne" needed? 6 pts 2. If f1(N) = 2N and f2(N) - 3N, why are they both O(N), since 3N is larger than 2N for N>=1? 6 pts 3. If a function is known to be O(N), what would you expect to happen to the running time if the input size is doubled? What if the function was O(N*N)? Explain your answer. 6 pts 4. Since Big-o notation is a mathematical tool for functions like f(N) or g(N), how is it applicable to algorithm analysis? 6 pts 5. Which grows faster, 2an or n! ? Why? 10 pts (2 each) 6. Give the Big-o notation for the following expressions : a. b. c. d. 6. 4n^5 + 3n^2 - 2 5^n - n^2 + 19 (3/5)*n 3n * log(n) + 11 [n(n+1)/2 + n] | 2 Type here to search o e * 30