Recursive Fibonnaci Method in Java

Problem:

Write a recursive method that computes the Fibonacci value of a given number. The Fibonacci sequence is as follows: 1, 1, 2, 3, 5, 8,..
For example, Fib(5) = 8

Output:

Not needed.

Solution:

public class ProblemE
{
 public static int fibbonaci(int n)
 {
  if ( n < 2)
   return 1;
  else
   return fibbonaci(n - 1) + fibbonaci(n - 2);
 }
 
}