golang

### Calculate Total Execution time to Compute Fibonacci Sequence

An exponential big-O is represented by: O(c^n) The n in an exponential problem means that the time of each consecutive computation of n will increase by c^n. Recursively computing the Fibonacci sequence is a simple example of exponential big-O problems. Let’s take a look: package main