Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. The conventional algorithm for evaluating a polynomial anc" + an-1" - 1 + ... + a1c + ao at x = c can be expressed in pseudocode by procedure polynomial, ao, 21, ..., ani real numbers) power := 1 y = ao for i:=1 to n power := power* c y = y +a;* power return yy= anc" + an-10"-1 + ... +ac+ ao } where the final value of y is the value of the polynomial at x = c. Exactly how many multiplications and additions are used to evaluate a polynomial of degree n at x = c? Multiple Choice 3n multiplications and 2n additions n multiplications and n additions n multiplications and 2n additions 2n multiplications and n additions