Write a MIPS assembly program to calculate the Fibonacci numbersfrom **1..n** using the recursive method. Thedefinition of a Fibonacci number is F(n) = F(n-1) + F(n-2).

The implementation must follow the following guidelines:

- Prompt the user for a number
**n** - Allocate heap memory to hold the exact number of elements inthe Fibonacci sequence for
**n** - Implement recursive Fibonacci method as a subprogram
- Print the Fibonacci sequence array

## Expert Answer

Answer to Write a MIPS assembly program to calculate the Fibonacci numbers from 1..n using the recursive method. The definition of…