Write recursive and dynamic programming algorithms to

Question

1. Write recursive and dynamic programming algorithms to compute Fn.
2. Call them Algorithm Fibon1 and Algorithm Fibon2.
3. Convert these algorithms to properly documented, professional quality programs. Call the programs FibonP1 and FibonP2, respectively. In the heading documentation, in addition to your name, ID no., course and purpose, clearly state the language/ editor/ compiler/ operating system/ computer used.
4. By executing programs FibonP1 and FibonP2, print Fibonacci Numbers F0 to F10 to demonstrate that both programs produce correct results. Generate properly-labelled outputs. Remember that F0 = F1 = 1.
5. Try running both programs for n = 10, 20, 30, 40, 50 and 60. You will start to notice something important from the viewpoint of Computing Science and COMP 3051. Keep in mind the largest possible integer that can be represented on a 32-bit & 64-bit computer system. Use the internal clock to record the time to run each case.
6. Tabulate your results (n versus result versus time) from question 4 into two tables, one for FibonP1 and the other for FibonP2.

Analyse your algorithms and results (provide a detailed critical evaluation) from the viewpoint of "algorithm design and analysis" based on the above tables and your knowledge of COMP 3051. Include comments on the accuracy of your results. Use graphs or any other enhancements to support your analysis.