I'm attempting to evaluate 3x^2 + x + 1 at x = 2. Also, how many multiplications are used by this algorithm to evaluate a polynomial of degree n at x = c?

procedure Horner(c, a0, a1, a2, ... , an : real numbers)

y:= an

for i := 1 to n

y := y * c + a (n-i)

{y = an c^n + a(n-1) c^n-1 + ... + a1c + a0}