please do this in python 3.8 without numpy

Question 2 (10 Points) How Many Fibonacci Numbers are required To Accurately Estimate The Golden Ratio? Fibonacci numbers are formed by adding the two preceding numbers as shown in the series. F = 1, 1,2,3,5,8,13 .... The ratio of the Fibonacci number approaches , the Golden-Ratio, for large values of n. In a well-documented Python program, hmwk3Q2.py, implement a program that calculates the F Fibonacci number and forms the ratio which approximates o. Inside a while-loop, your program will continue to calculate the next Fibonacci until a specified level of precision in the estimate is achieved, when compared to the exact value for the Golden-Ratio. The Golden-Ratio is Your program should accept and an integer M from the user. M represents the accuracy of the estimate by comparing your estimate with 10-M. That is, if M = 2, then your program should increment n until 1-0 10-2 or 0.01. As a comment in your program list the number of Fibonacci terms required to attain accuracy to M = 9. That is 10-9 Hints: Inside a while-loop continue to form another Fibonacci number until abs (plus - )