Write a MIPS recursive function fib$($n$)$ that computes the nth element in the Fibonacci sequence. Write a main function to call fib.

int fib $($int n$)\{$

if $($n $<2)$ return n;

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

$\}$