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.

code:

fib:

SUB SP$,$ SP$,$ #$16$

STR LR$,[$SP$]$

CMP X$0,$ #$0$

BEQ base$\_$zero

CMP X$0,$ #$1$

BEQ base$\_$one

SUB X$1,$ X$0,$ #$1$

MOV X$0,$ X$1$

BL fib

MOV X$2,$ X$7$

SUB X$0,$ X$1,$ #$1$

BL fib

ADD X$7,$ X$7,$ X$2$

LDR LR$,[$SP$]$

ADD SP$,$ SP$,$ #$16$

RET

base$\_$zero:

MOV X$7,$ #$0$

LDR LR$,[$SP$]$

ADD SP$,$ SP$,$ #$16$

RET

base$\_$one:

MOV X$7,$ #$1$

LDR LR$,[$SP$]$

ADD SP$,$ SP$,$ #$16$

RET

ERROR SS BELOWYour code must pass all tests to earn any marks. Try again.