*** Please Read Carefully****

I do not expect you to provide the paper or data I have composed the programs and have the data

** I need help formulating an OUTLINE see below

This part of the project is a written analysis of two algorithms of calculating Fibonacci numbers: recursive (part A) and iterative (part B). Show the theoretical order of growth of the running time for both algorithms. Then include experimental results based on a program that will compare running time of the recursive and iterative functions for calculating Fibonacci numbers. Call each function for the same size of input n and find their running times. Thank you so much for your help