Each number in the Fibonacci series is the sum of the previous two numbers. fib(n) is the fibonacci number of n

(a) What is fib(n) for n = 0 and n = 1?

(b) Write a function called fib in a high-level language that returns the Fibonacci number for any nonnegative value of n. Hint: You probably will want to use a loop. Clearly comment your code.

(c) Convert the high-level function of part (b) into MIPS assembly code. Add comments after every line of code that explain clearly what it does. Use the SPIM simulator to test your code on fib(9). (See the Preface for how to install the SPIM simulator.)

Im using the Mars Mips Porcessor instead of SPIM, but im sure the code translates easily between them