Given a positive integer n, find the nth Fibonacci number. The Fibonacci sequence is a sequence of numbers where each number is the sum of the two previous numbers.

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17                # we want the square root of 17 for exampleg = 4                 # our guess is 4 initiallyerror = 0.0000000001  # we want to stop when we are this closewhile abs(n - (g**2)) > error:  g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point   Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!

The statement 2n< n!  is valid for a.All positive integers b.All positive integers n ≥ 4 c.For only n=4d.All positive integers n ≤ 4