USING MIPS:

Fibonacci Numbers in Assembly

Create a function that uses recursion to calculate a fibonacci number. The function should have one parameter $($which Fibonacci number$)$ and one return value. Using a loop in main, print out the first ten fibonacci numbers.

Remember that the Fibonacci sequence of numbers is $1,1,2,3,5,8,13,...$ where each number is derived by adding the previous two numbers together, and the first and second numbers are one.

If this function were written in C or Java, it would look something like:

int fibonacci$($ int whichOne$)\{$ if$($ whichOne $<1)$ return$(0)$; if$($ whichOne $<3)$ return$(1)$; return$($ fibonacci$($ whichOne $-1)+$ fibonacci$($ whichOne $-2))$; $\}$

Note: Use stack pointer