Would love the code for this!

Thanks :)

QUESTION 1 (5 MARKs) The following well known sequence of numbers is called the Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, .. where each number in the sequence is the sum of the previous two numbers, e.g., the next Fibonacci number in the above list is obtained by adding 21 and 34. One way of calculating the nth Fibonacci number is using the following formula (known as Binet's formula) and rounding the result to the nearest whole Using this formula, you can compute: (2)1 E (3)2 f(4)3 E (5)5 etc... Write a program which calculates a particular Fibonacci number f (n) where n is always a positive whole number less than or equal to 50. Name your program file YourUsernA101.py', e.g., afer023A1Q1.py Below are four example outputs from the completed program (using different variable values). Your program must give the correct output in the same format as the outputs in the four examples below: fibonacci (7) 13 fibonacci (10) = 55 fibonacci (50) = 12586269025 fibonacci (23)28657 Paste the following statement into the start of your program