My code does not work. Assume that X$0$ contains a positive integer value. Write a recursive procedure with the label "fib" that calculates the X$0$th entry of the Fibonacci sequence, F$($X$0).$ In essence, your procedure should implement the following C function:

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

if $($n$==0)$

return $0$

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

return $1$

else

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

$\}$

The argument will be provided in X$0.$ Leave the result, F$($X$0),$ in X$7.$

Note: You must implement the function using recursion! Iterative solutions will not pass!

For convenience of debugging, a procedure labeled "debug:" has been defined which will print the values of all non$-$zero registers $($through x$29).$ Remove any calls to debug: for final submission.