Multiple choice and True or false, you do not need to clarify or explain the answers.

What is the best case time complexity of insertion sort? Omega(n logn) Omega(n^2) Omegalog n) Omega(n) Assume each arithmetic statement takes c time to complete in a given algorithm. During the procedure of computing the time complexity, what is the cost of processing a comment.? Zero O 0.1c ck, where k is the number of comments. Consider the following function: f(n) = 53 n^3 + 3^n +6 Which of the following big-Oh notations most closely describes the big-Oh of this function? O 0(1), aka constant time O(log (n)) O(n), aka linear time O( n log(n)) O(n^2 ), aka quadratic time O(n^3), aka cubic time O( 24 ), aka exponential time O( 3an ), aka exponential time something else QUESTION 2 Let f(n) = 34 (log n) 4 and let g(n) = 2 n log(n). Then f(n) is ( g(n)). True False Let f(n) = 6 n logn and let g(n) = 45 n 2. Then f(n) is O( g(n)). O True False