For this assignment, you will be exploring the Fibonacci sequence through programming. Complete the following tasks:

Research and take note of the recursive formula F$($n$)$ that can be used to define the Fibonacci sequence.

How is the Fibonacci sequence related to the golden ratio $\backslash$Phi $?$

Is there a closed formula for F$($n$)?$ If so$,$ what is it$?$

Design a simple program, using pseudocode, to implement the recursive formula you found in part $($a$)$ to compute numbers in the Fibonacci sequence.

Determine the number of times your program computes F$(1)$ for each time F$(5)$ is computed.

Discuss any issues you find with your program and what reasoning there may be$.$