Algorithm Question:

Problem 1. Given a polynomial p(x) = anr" + an-1Xn-l + + a,a + ao, where the coefficients are ai's, Horner's method is an efficient algorithm for evaluating the polynomial at a number c that works as follows: Multiply an by c, then add an-1. Then multiply the result by c and add an-2. Then multiply the result by c and add an-3 and so on until you reach ao. This over all gives an O(n) algorithm for evaluation of p(c) Apply Horner's method to the polynomial p(x) 5r3 -2r2+3z-7 at c 2. How many multiplications and additions