Design an algorithm of ( n ) for evaluating a polynomial of the form

px= an xn+ an-1 xn-1+ + a1 x+ a0

Please give the pseudo-code and a description of the algorithm. Hint: you may assume the coefficients a0, a1, , an are stored in an array A[0..n]. The value of x is given as an input to your algorithm as well as the array of coefficients. Obviously, you would like to do as few multiplications as possible