Question 3 Implement the following C code in MIPS assembly. The Fibonacci sequence is a series of numbers, where a number is found by adding up two numbers before it. Starting with O and 1, the sequence goes 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on and so forth till infinity. int fib(int n) { if (n=0) return 0; else if (n == 1) return 1; else return fib(n-1) + fib(n-2)