Task 1: Fibonacci numbers can be very large. In this task, you need to write assembly language code to compute large Fibonacci numbers. The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
Each number in the sequence is found by adding up the two numbers before it:
0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...
Suppose you must compute Fibonacci number 12, that is, fib(12). Assume 12 is given in a register r0. Your program should compute 144 and write the value in register r1. Take a few snapshots of the loop iteration and prove your program is working.
Task 2: Write an assembly program to do the following:
a. Store the following array at memory location 0x4000 004C:
12, -4094, -1000, 2012, 8, 0, 150, 200004, -1245, 2222
b. Read this array, add a constant 10, and write the results into a different memory location 0x4000 00AC.
GOOD LUCK!