You are given an input integer array P $=[$a$0,$ a$1,$ a$2,...$ an$]$ of length n $+1$ that stores the coefficients of an n degree polynomial p$,$ and an integer value x$.$ Your goal

is to compute the value of p$($x$)=$ a$0+$ a$1$x $+$ a$2$x$2+$ a$3$x$3+...$ anxn for an input x$.$ You may

assume that all elementary integer operations $(+,-,*,/)$ take O$(1)$ time.

Consider the following algorithm, and convince yourself that it correctly evaluates the polynomial.

def polyEval$($P$,$x$)$:

ans $=0$

for i in range$($n$+1)$: $//0...$n

term $=$ P$[$i$]$

for j in range$($i$)$:

term $=$ term $*$ x

ans $=$ ans $+$ term

return ans

What is the runtime of this algorithm? Choose between stating the answer as big$-\backslash$Theta or big$-$O as appropriate, choosing the $*$most$*$ restrictive answer when possible.