Fibonacci Sequence with Recursion: Write a recursive MIPS

assembly program in the MARS simulator to print the Nth integer in the Fibonacci

sequence. Prompt the user for N and read the input value N $($we will only test with N

greater than $0).$ Recall that procedures are invoked with the jal instruction and you

must perform appropriate saves$/$restores before$/$after the procedure invocation. The

pseudo code for procedure Fib is shown below:

procedure Fib$($N$)$

if $($N $==0)$ return $0$

if $($N $==1)$ return $1$

return Fib$($N$-1)+$ Fib$($N$-2)$

An example run of the program:

Enter an integer greater than zero:

$7$

Element $7$ of the Fibonacci sequence is: $13$