Need help with these please.

Question 1 Suppose your code iterates through a list containing n elements, and prints each value in the list in the order the code comes to it. What is the big-O time analysis of your code? Not yet answered Points out of 10.00 Select one: O a O(log n) Flag question O b. 0(1) Oc O(n) O d. oina) Question 2 . Not yet answered How many of the following formulas are O(n)? n3 - 3n2 0.25n2 2n2 * 14n . (n + 2)(n-2) * Points out of 10.00 Flag question Select one: O a. 1 O b. 2 Oc3 c. 3 O d. 4 Question 3 Same question from the 1.2 quiz: Match the smallest run-time complexity to 1, the next smallest to 2, and so forth. Not yet answered Points out of 24.00 Oin2 log n) Choose... - Flag question 1 Oin log n) Choose... Qn) Choose... - O(n) Choose... On) Choose... + Odlog n) Choose