Weekly Assignment/Discussions via Unicheck:
From the lecture notes, run two Python Fibonacci sequence programs; One as a Recursion and the other as an iteration. Make your maximum recursion and iterations 1000. Can you see a difference in the time they take to run? Add a timer in the programs if you like, but can you visually see the difference?
