In order to get a better feel for recursion, run the two recursive programs, for Greatest Common Divisors and Fibonacci numbers. You can find them in the online version of the notes.
Write your own Driver classes for both where you call them each twice for two different tests of values. You are going to turn in both your source code and output.