This animation shows the time complexity of the recursive implementation of the fibonacci computation. Click the "next step" button to run the animation. Note: we assume each add operation takes constant time, and we use C to denote this constant time.