Problem 1 Write a non-recursive program using MIPS instructions that prints the Fibonacci Se. quence up to the 22nd number. Where To = 0 and Fi = 1 Fibonacci Sequence: F(11) = F(-1) + F( -2) Environment. You test your code using the MIPS32 Simulator called SPIM available for most platforms, https://sourceforge.net/projects/spimsimulator /files. Expected Terminal Output. Here is the expected terminal output: 011 23 5 8 13 21 34 55 89 144 233 610 987 1597 2584 4181 6765 10946 Problem 1 Write a non-recursive program using MIPS instructions that prints the Fibonacci Se. quence up to the 22nd number. Where To = 0 and Fi = 1 Fibonacci Sequence: F(11) = F(-1) + F( -2) Environment. You test your code using the MIPS32 Simulator called SPIM available for most platforms, https://sourceforge.net/projects/spimsimulator /files. Expected Terminal Output. Here is the expected terminal output: 011 23 5 8 13 21 34 55 89 144 233 610 987 1597 2584 4181 6765 10946