$1.$

a$.$ Write a function $\backslash ($ f i b $1()\backslash )$ using iteration, that takes an int $\backslash (\backslash$boldsymbol$\{$m a x$\}\backslash )$ as input, and calculates and prints all the Fibonacci numbers below max. The function also returns a value indicating how many numbers in the Fibonacci sequence have a value less than max.

b$.$ Write a function fib$2()$ using recursion, that takes an int $\backslash (\backslash$boldsymbol$\{$n$\}\backslash )$ as input, and calculates the $\backslash (\backslash$boldsymbol$\{$n$\}^\{\backslash$text $\{$th $\}\}\backslash )$ Fibonacci number.

c$.$ Randomly generate an int $\backslash (\backslash$boldsymbol$\{$m a x$\}\backslash )$ between $25$ and $250.$ Call fibl$($max$)$ and print the value returned by $\backslash ($ f i b $1()\backslash )$ with a suitable message.

d$.$ Ask the user to input a number $\backslash (\backslash$boldsymbol$\{$n$\}\backslash )$ between $5$ and $16$ You can assume the user will enter a valid input in the proper range. Use the function fib$2()$ to generate and print the first $\backslash (\backslash$boldsymbol$\{$n$\}\backslash )$ numbers in the Fibonacci sequence.

Sample outputs $($for parts c and d respectively$)$: