Problem 2. In this problem we want to find the value of a polynomial, p(2), for a given value of x, using: p(x) = anx" + an-1.4- +...+011+ ao Assume, you are given an array A[0, ..., n] of the coefficients do, ...,an. For this problem the cost is computed by the number of multiplications. (a) Write pseudo-code for a brute-force algorithm to find the polynomial value in the worst- case. Analyze the exact number of multiplications. Show your work. (b) Write pseudo-code for an optimal algorithm to find the polynomial value in the worst-case. Analyze the exact number of multiplications. Show your work