AP Computer Science --- Haas --- RecursiveFibonacci

Complete the code below which returns the nth fibonacci number.

/**
 * Returns the nth fibonacci number.  
 * For example: fib(8) returns the value 21
 * 
 * See below:
 * 
 *    1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...
 * 
 */
public class RecursiveFibonacci
{
  public static int fib( int n )
  {
    if /** COMPLETE THE CODE **/
      return /** COMPLETE THE CODE **/
    else
      return /** COMPLETE THE CODE **/
  }
  
  public static void main ( String[] args)
  {
    System.out.println(fib(8));
  }
}