Each number in the Fibonacci series is the sum of the previous two numbers. Table 6.16 lists the first few numbers in the series, fib(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).

Transcribed Image Text:

1 2 3 4 5 6 7 8 9 10 11 fib(n) 1 1 2 3 8 13 21 34 55 89