The Fibonacci series is a numerical series where each item is the sum of the two previous items. It starts off like this:
0, 1, 1, 2, 3, 5, 8, 13, 21 ...
Write a method called fib() that takes an integer n and returns the nth Fibonacci.
Be sure you can talk through each part of your thinking with your partner.
Supplement your solution with unit & integration tests.