Write an ASM program that reads an integer N and then displaysthe first N values of the Fibonacci number sequence, describedby:
Fib(0) = 0, Fib(1) = 1, Fib(N) = Fib(N-2) + Fib(N-1)
Thus, if the input is N = 10, your program should display thefollowing single line:
Fibonacci sequence with N = 10 is: 0 1 1 2 3 5 8 13 21 3455.
Your MAIN program should call a recursive Fib procedure withparameter k, and the Fib procedure should return the k-th Fibonaccinumber in register EAX, and then the MAIN program should displaythe k-th Fibonacci number in the sequence.
You may want to declare the Fibonacci sequence as an array ofsize N, called FibSeq, and then have the Fib procedure to computethe value of each cell of the array. Also, there are other ways todo this.
Answer to Write an ASM program that reads an integer N and then displays the first N values of the Fibonacci number sequence, desc…