In java

The Fibonacci Sequence is the series of numbers:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...

The next number is found by adding up the two numbers before it.

• The 2 is found by adding the two numbers before it (1+1)

• The 3 is found by adding the two numbers before it (1+2),

• And the 5 is (2+3),

• and so on!

Example: the next number in the sequence above is 21+34 = 55

Write a function int fibonacci(int n) that returns Fn( the nth number in the Fibonacci sequence).

Given a number n, print n-th Fibonacci Number. Examples:

if n = 0, then fibonacci(0) should return 0. If n = 1, then it should return 1. For n > 1, it should return Fn-1 + Fn-2