IN MIPS ASSEMBLY!!!

rfib Write a recursive function in MIPS that takes one integer argument and returns the Fibonacci

number corresponding to that argument:

rfib$(0)=0$

rfib$(1)=1$

rfib$(2)=1$

rfib$(3)=2$

rfib$(4)=3$

and so on$.$

Your code should handle non$-$negative integer argument values, including zero. No need to error check

for negative arguments. The function should adhere to all calling conventions, so the argument will be

passed to rfib in a$0$andshouldbereturnedfromrfibinv$0.$