$(1$ point$)$

Assume $n$ is a positive integer. Our goal is to find a power function $g(n)=n^p$ such that the algorithm below is $O(n^p).$

$x$:$=3$

$y$:$=2$

$z$:$=70$

for $j$:$=3to5n$

$x$:$=2*(x+j)-7$

$y$:$=x+j^2-n+4*j$

$z$:$=x+y$

next $j$

There are

operations performed in each run of the loop and the loop runs

times, so the total number of operations performed in this loop is

Therefore, by the order of a polynomial theorem, this algorithm is $O($

$.$