Write an ASM program that reads an integer number N and then displays the first N values of the Fibonacci number sequence, described by:

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 the following single line: Fibonacci sequence with N = 10 is: 55 34 21 13 8 5 3 2 1 1 0

Note: the Fibonacci sequence should be displayed in the order given above