Exercise $1$

Write a recursive MIPS program that computes this sequence of numbers $(0,1,3,9,35,169,987,6769,53307,473841,4691027,......)$ can be computed with the following recursive function:

int funt $($int n$)$

$\{$ if $($n $==0)$

return $0$;

else if $($n $==1)$

return $1$;

else

return $($n$-1)*$funt$($n$-1)+($n$-2)*$funt$($n$-2)+2$;

$\}$

Thus, funt$(0)=0,$ funt$(1)=1,$ funt$(2)=3,$ funt$(3)=9,$ funt$(4)=35,$ funt$(5)=169,$

funt$(6)=987,$ funt$(7)=6769,,....$ funt$(10)=4691027.$ Be sure you aren$$t off

by $1$ in the sequence!

Your main code is

main$()\{$

cout$<<$"Please enter n: $"$;

cin$>>$ n;

cout$<<$"The number series of n numbers is: $"$;

for $($int i $=0$; i $<=$ n; i$++)\{$

cout$<$