Only 4 please help me!

Section 3.1: How many comparisons does the insertion sort use to sort the list n, (n - 1), (n - 2), ..., 2, 1? 2. Section 3.2: Determine whether each of these functions is O(x^2). a) f(x) = 10 b) f(x) = x^2 + 100 c) f (x) = x log x d) f(x) = x^2/2 e) f(x) = 2^x Section 3.2: For each of the above, determine if they are Ohm(x^2) and whether if they are theta(x^2). Section 3.3: Give Phi-notation for the number of arithmetic operations performed by the following code. Explain how you got your answer: t: = 1 for i: = 1 to n for j = 1 to i t: = t+ 1