Any information to help explain the recursive method and iterative method would be a great help and thank you for all your help.

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 computer any term

in the Fibonacci sequence. Here are the signatures of the two methods.

public static int FibR( int n).

public static int FibI( int n).

A sample run of your program is as follows.

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.