1. The following pseudocode is an efficient algorithm to evaluate polynomials to evaluate anx" +an-1x"-1 + +ajx ao atc. . This pseudocode shows how procedure Horner(c, ao, ai, a2, ..., an: real numbers) TL for i :- 1 to n + an-ic-l + + aic + ao) (a) Evaluate r3 + 3a2 + x +1 at x - 2 by working through each step of the algorithm showing the values assigned at each assignment step. (5 pts) ) Exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x c? (Do not count additions used to increment the loop variable.) (5 pts)