public static int rabbit(int n) {
// ---------------------------------------------------
// Computes a term in the Fibonacci sequence.
// Precondition: n is a positive integer.
// Postcondition: Returns the nth Fibonacci number.
// ---------------------------------------------------
   if (n <= 2) {
      return 1;
   } 
   else  { // n > 2, so n–1 > 0 and n–2 > 0
      return rabbit(n-1) + rabbit(n-2);
   }  // end if
}  // end rabbit