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

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

int fib$($int n$)$

$\{$

if $(\}\backslash$textrm$\{$n$\}==0$

return $0$;

$1$

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

return $1$;

else

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

$\}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.