Tail Recursion

How do i make this function tail recursive in java


public int fib(int n)
{
  return( n <= 1 ? n : fib(n-1) + fib(n-2) );
}

>>10

Yeah, it's something I would only consider using for debugging purposes. Although even, then, I doubt the resulting stack trace or a normally tail recursive program would be very readable.