// Complete the C++ function // The Fibonacci sequence is a recursive sequence in which every term is the // sum of the previous two terms. The sequence starts with 0 and 1 so // the Fibonacci sequence becomes 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ..., etc. // Implement the function below.

// Returns the N-th Fibonacci number, recursively. The zeroth Fibonacci number // is 0, and the first is 1. int fib(int n) { //Code goes here }