Turn in your Fibonacci function from the practice slide. You can just put the
function definition in a .py
file on its own; no need to do any input or output.
Make sure that your function is named fib
.
We don't expect your function to be very fast for \(n > 30\), so you do not have to worry about implementing it non-recursively.