For this Question: Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values.

In the fibonacci series, each number (Fibonacci number) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like -
0, 1, 1, 2, 3, 5 and so on..<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Fibonacci()</b> that takes the integer N as a parameter.

Constraints: 
1 ≤ T ≤ 10
1 ≤ N ≤ 30Return the Nth Fibonacci number.Sample Input 
2
3
5

Sample Output
2
5

Explaination:
Test case 1-> N = 2
Seed values are 0 and 1
So, F<sub>1</sub> = 0 + 1 = 1
F<sub>2</sub> = 1 + F<sub>1</sub> = 1 + 1 = 2, I have written this Solution Code:   static long  Fibonacci(long  n) 
    { 
       if (n == 0) 
      { return 0;}
       else if(n==1){
           return 1;
       }
    return Fibonacci(n-1) + Fibonacci(n-2); 
    } , In this Programming Language: Java, Now tell me if this Code is compilable or not?