Write a recursive method definition for a static method that has one parameter n of type int and that returns the nth Fibonacci number. F0 is 1, F1 is 1, F2 is 2, F3 is 3, F4 is 5. And in general Fi+2 = Fi + Fi+1 for I = 0,1,2,...
Place the method in a class that has a main that tests the method.