CH Write the recursive and non-recursive formula for Fibonacci sequence. After doing so, time the operations of the following elements of in the Fibonacci sequence: 1, 5, 10, 15, 20, 25, 30, 35, 40, 45 THE RESULT SHOULD LOOK LIKE THIS (TABLE FORMAT): Fib(n) Fib NR Fib R In the FIB NR, and Fib R it should state the time (how long it took to generate the number in the sequence)