(((INCLUDE MAIN))))

This program computes the Fibonacci numbers in the sequences 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... For example, if the user inputs 3, the result should be 2. If the user inputs 6, the result should be 8. If the user inputs 0, the result should be 0.

Note: You can translate the following recursive function in C to MIPs code.

int fib(int n) { if (n 1) return n; else return fib(n - 1) + fib(n - 2); }