Write a subroutine using the SIC (standard version) assembly language to calculate the first 16 Fibonacci numbers (see Fibonacci function below). Then, apply the algorithm in Fig. 2.4 (of Becks book as attached) to assemble your program. Repeat the above using SIC/XE and generate the object code for each instruction.

//Fibonacci Series Function using Recursion (0, 1, 2, 3, 5, 8, 13, 21, 34, 55, ) Unsigned int fib (Unsigned int n) { { if (n <= 2) return n; else return fib(n-1) + fib(n-2); }