Please do not copy from other chegg answers. my CWID ends with $470.$

Consider the following recursive algorithm $($the same as in Question $1)$:

Let $abc$ be the last three digits of your CWID; $/"$ my CWID ends with $651$;$a=6,b=5$;$c=1*/$

if $(n==1)$ return $c$;

if $(n==2)$ return $b$;

if $(n==3)$ return a;

int $x=f(n-1)+f(n-2)$;

If $(n$ is even and $x$ is even$)$ then $x=x+f(n-3)$;

return $x$;

;

Develop a dynamic programming algorithm that calculates and returns the same value of $f(n)$

for any given integer $n1.$ That is$,$ develop a dynamic programming algorithm equivalent to

the recursive algorithm $f(n).$

Your algorithm must be iterative and not recursive.

Describe your algorithm using C$++-$ like syntax.