fobonnci series using recursion

import java.util.*;

public class Main {
public static void main(String[] args)
{
System.out.println(fibo(4));
}
public static int fibo(int n)
{
if(n==0) return 0;
if(n==1) return 1;
int prev=fibo(n-1);
int prevk=fibo(n-2);
return prev+prevk;
}
}