Using Java only!

In mathematics, the$$Fibonacci sequence$$is a$$sequence$$in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as$$Fibonacci numbers, commonly denoted$$Fn$.$

Starting from $0$ and $1,$ the sequence begins

$0,1,1,2,3,5,8,13,21,34,55,89,144,....$

Write a program with $2$ functions where$$

$1.$ The first function implements the recursive approach to find out the nth number in the Fibonacci sequence. $($e$.$g$.,$ the $6$th Fibonacci number is $5)$

$2.$ The second function implements an iterative approach to perform the same $($find the nth number in the Fibonacci sequence$)$

$3.$ Compare the running time of the both functions.