public class Fibonacci {
    /*
     * Alternative version of the method traced in lab.
     * This version has only one return statement.
     * Note that the base case is implied by the value 
     * assigned to the result variable at the start of the method.
     */
    public static int fib(int n) {
        int fib = 1;

        if (n >= 2) {
            fib = fib(n-1) + fib(n-2);
        }
            
        return fib;

    }
}