Exam 1 practice problems Remember to also pactice: Homework, quizzes, class examples, slides, reading materials P1 (MC) For all the questions below (except for the True or False questions), the answer can be none, one, some or all of the choices. Write your answers on the LEFT side. No justification needed. (3 points each question) a) If f(N)-O(g(N)), then f(N) (g(N)). True or False b) Insertion sort is O(N'). True or False c) Which of the following is always a correct description of the time complexity of the code below (regardless of what someFunction does)? A. (N) B. O(N) C. (N) D. O(NIgN) int k; for (k-1 k