Rewrite the Fibonacci method from the class example using iteration (i.e., without recursion). Test your method by prompting the user to enter an index and display the Fibonacci number.

Example fib(index) = 0 for index = 0 fib(index) = 1 for index = 1 fib(index) = fib(index - 1) + fib(index -2) for index 2 2 Fibonacci-series problem: age x ClassExamples.java X History import java. util . Scanner; public class ClassExamples { public static int fibonacci (int index) { if /index == 01 return 0; else if (index == 1) return 1; else return (fibonacci (index-1) + fibonacci (index-2) ) ; public static void main (String args) { Scanner input = new Scanner ( source: System. in) ; System. out. printin ( *: "Enter an index for Fibonacci number: ") ; int index = input . nextInt () ; System. out. printin("The Fibonacci number at index " + index + " is " + fibonacci (index) )