CPP - Assembly work

In the Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, …., the next number is always the sum of the previous two . The following function calculates the nth Fibonacci number by calling itself recursivly: unsigned int fib(unsigned int n) { if (n==1 || n==2) return 1; else return fib(n-2) + fib(n-1); } Professor Mobonacci has recently modified the Fibonacci sequence, where each number, f(n), in the sequence is f(n – 2) / 2 + f(n – 1) * 2 (Note: the division is integer division). The first two numbers are specified to be 1 and 2. So the sequence is 1, 2, 4, 9, 20, 44, 98, 218, … . In this assignment, you are asked to write a recursive function Mobonacci in assembly to calculate the nth number in such sequence. You also need to write a main function in c++ which reads a positive integer n, calls the Mobonacci assembly function with the parameter n, and the displays the result. You need to hand in a document (around 2-3 pages) describing your code, experiences in debugging your program, etc. In your report, you also need to draw how the stack grows and shrinks when the function Mobonacci is called with the parameter 5.