2. The following method returns the ith number in the Fibonacci sequence: 1, 1,2,3, 5, 8,13,… Each number after the first two is the sum of the two preceding numbers. fib(0) returns 1; fib(1) returns 1; fib(2) returns 2, fib(3) returns 3, fib(4) returns 5, fib(5) returns 8, and so on public static long fib(long i) if (i < 2) return 1; return fibi-1)+ fibi-2 Each time you call this method and pass it a
OR
OR