#$4-$ attach a Python file with the answers to a$,$ b$,$ and c below. You should place your answer to part c in a comment in the file. Python uses the syntax $\text{'}\text{'}\text{'}$ multiline comment $\text{'}\text{'}\text{'}$ for multiline comments. Or place a # on every line of your comment.

a$)$ Create an iterative $($using a loop$)$ Python function that can be used to generate the Fibonacci number f$($n$).$ Example: print$($Fibonacci$(7))$ would generate the output: $13$

b$)$ Create a recursive Python function that can be used to generate the Fibonacci number f$($n$).$ Example: print$($RecursiveFibonacci$(7))$ would generate the output: $13$

c$)$ Which algorithm is better, the iterative or the recursive? Give several reasons to justify your answer. $($HINT: What is the Big$-$O of each?$)$