Hi, I need help with this java problem.

Please use simple Java code. This is not an upper level class. Thank you :)

The Fibonacci sequence is defines as follows.

f(0) = 0, f(1) = 1, and f(n) = f(n 1) + f(n-2) if n > 1.

Write a recursive method and an iterative method to compute any term

in the Fibonacci sequence.

The signatures of the two methods are shown below:

public static int FibR( int n).

public static int FibI( int n).

A sample run of the program is shown below:

Input an integer for the index of a term in the Fibonacci sequence:

10

the 11-th term "55" in the Fibonacci sequence can be computed recursively.

the 11-th term "55" in the Fibonacci sequence can be computed iteratively.