Solve the following by converting it into MIPS Assembly.

b) Recursively using either one of the following two options: o Option 1 - a caller that calls the recursive routine "unsigned int fib(unsigned int n" from Problem 2.31 (in chapter 2 of the second textbook) from HW07 unsigned int fib_seq (unsigned int n, &fib_array) ( for i 0 to n fib array[i] fibi) return fib_array [n];) where unsigned int fib(unsigned int n) if (n=0 11 n=1) return n; else return fib(n-1) + fib (n-2)) b) Recursively using either one of the following two options: o Option 1 - a caller that calls the recursive routine "unsigned int fib(unsigned int n" from Problem 2.31 (in chapter 2 of the second textbook) from HW07 unsigned int fib_seq (unsigned int n, &fib_array) ( for i 0 to n fib array[i] fibi) return fib_array [n];) where unsigned int fib(unsigned int n) if (n=0 11 n=1) return n; else return fib(n-1) + fib (n-2))