Two students as a team:

$1)$ Write a recursive method FibonacciLinks to an external site.$$that prints the sequence

of Fibonacci number $($n$).$

You also write a main method that will determine the value of Fibonacci $(2000),$ then print the sequence as the Fibonacci sequence $($up tp $2000)$ is:

$.............................$

$2)$ Due to time complexity of the recursion, now you write an iteractive code $($loop$)$ to resolve the same problem. Write a loop method Fibonacci that print the sequence

of Fibonacci number$($n$).$

You also write a main method that will determine the value of Fibonacci $(2000),$ then print the sequence as the Fibonacci sequence $($up tp $2000)$ is:

$........$

PS: One method: You can save one number, before you get the next larger number.