Submit the program with the recursive and non-recursive methods for factorial and Fibonacci.

These are the recursive methods. I need the non-recursive methods.

Factorial:

Given n of 1 or more, return the factorial of n, which is n * (n-1) * (n-2) ... 1. Compute the result recursively (without loops).

public int factorial(int n) { if (n==1) return 1; return n* factorial(n-1); }

Fibonacci:

The fibonacci sequence is a famous bit of mathematics, and it happens to have a recursive definition. The first two values in the sequence are 0 and 1 (essentially 2 base cases). Each subsequent value is the sum of the previous two values, so the whole sequence is: 0, 1, 1, 2, 3, 5, 8, 13, 21 and so on. Define a recursive fibonacci(n) method that returns the nth fibonacci number, with n=0 representing the start of the sequence.

fibonacci(0) 0 fibonacci(1) 1 fibonacci(2) 1 public int fibonacci(int n) { if (n<2) return n; return fibonacci(n-2)+fibonacci(n-1); }