Submit the following files:

Part $1.$ Write an iterative function and a recursive function to compute:

$f_1(x)={\displaystyle \underset{i=0}{\overset{n=100}{}}}(2*i+9)$

$f_2(x)=pro{d}_i=1^n=100(5*i^3+i^2)$

$f_3(x)={\displaystyle \underset{i=0}{\overset{n=500}{}}}(5*i{)}^{-\frac{1}{2}}$

Part $2.$ Determine the asymptotic notation using the big $O$ and big Omega of the following expressions

$f_1(n)=5n^3+10n^2+600$

$f_2(n)=20n^2+10n+n^3$

The most important part is not the answer but the justification of the answer based on the definition. Reuse the definition to justify your answer.

Part $3.$ Implement the iterative version of the Fibonacci function:

void Fib$($int x$,$int$*$ result$)$

where $x$ is the input and result is a pointer to the value we wish to return;

Example:

int $x=8$;

int result;

Fib$(x,$ &result$)$;

cout $$ result $$ end$1$; $//$ Display $21$ code in c$++$