Question 2. A polynomial of order n, ao +212+...+anx", is stored as an array of coefficients, (ao, Q1, ..., an). Suppose we wish to multiply the polynomial (ao, Q1, ..., An) with the polynomial (60, 61, ..., bn) under a model in which every multiplication and addition have a unit cost. As an example, the polynomial (2,5) multiplied with the polynomial (1,3) is (2, 11, 15), because (2 + 5x) x (1 + 3x) = 2 + 11x + 15x2 (i) How fast can you do that in 0 () notation? (ii) Describe your strategy using one paragraph. Question 3. Give explicit decision tree lower bounds in the binary comparison oracle model for these problems: (i) Finding the second smallest of four numbers. (ii) Sorting six numbers. (iii) Determining if a given number is present in a sorted array of five numbers