1. Define the following recursive function which is very similar to Fibonacci:

F(n) = 2 F(n 1) + 3 F(n 2);

F(0) = 1;

F(1) = 2.

Please implement the function in MIPS and make sure your implementation indeed works on the simulator, by printing the value F(4) to the terminal.