0. Finish and show any pending assignment. This is the last lab!

1. Look at the program FSDemo.java (under the group access) on the
course web site. This program was discussed in the class. Modify the
program to use exception handling to achieve the same effect.

2. Consider the iterative and recursive versions of the Fibonacci
programs. Measure and tabulate their execution times for values of upto
35 fibonacci numbers.

3. Demonstrate your project. Pls provide a small write up (not more than
half a page) which describes your project. Your tutor may nominate you
for the best project award. Top three projects will get awards.