$($Q$\mathrm{.}2)$ Recursive functions

$2.$a$)$ Implement the following C code in MIPS assembly.

int fib$($int n$)$

$\{$

if $($n$==0)$

return $0$;

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

return $1$;

else

return fib$($n$-1)+$ fib$($n$-2)$;

$\}$

$2.$b$)$ Implement a main function that calls the fib procedure implemented in $2.$a$),$ which

initializes the variable n to $3.$ Simulate your program in the SPIM MIPS simulator.

Run you program step by step observing the changes in the memory$/$register$.$ Take

a screenshot of $10$ important instances showing changes in the registers and memory.

$2.$c$)$ Implement a version of your program that allows: $($i$)$ the user to enter a value for

the variable n ; and $($ii$)$ prints the value of fib$(n)$ in the terminal.