1. [70 points] Write an assembly program to compute the nth number in the Fibonacci series. The first and second Fibonacci numbers are 0 and 1, respectively. Every subsequent Fibonacci numbers are the sum of the previous two Fibonacci numbers. For example, the third Fibonacci number is 1 (i.e., 0 + 1), the fourth is 2 (i.e., 1+1), the fifth is 3 (i.e., 1+2), and so on. The program must use a loop to compute Fibonacci numbers and display their values on the screen. Display the first 10, 15 and 20 numbers as test cases. 2. [30 points] Extend your solution to Problem 1 so that instead of displaying the list in the increasing order, the program shows the Fibonacci numbers in reverse order. Particularly, after constructing the original list, initialize another list with the same size in which you build the contents of this list from the original one in the reverse order.