Pick one of the following problems to do for your interclass problem.

1. Fibonacci - The Fibonacci sequence is a classic example of recursion. Each number is defined as the sum of the two before it. The first two numbers in the sequence are both one. This sequence is definied recursively in the following way. fib(n)=1 if n<2 otherwise fib(n-1)+fib(n-2). While this as a Java method. It should take a single integer argument, n, and return the integer value of that number in the sequence.

2. Recursive Removing - Write a recursive method that will remove all the actors in a list from the world. Put this method in our world subclass.

3. Recursive Addition - Write a method that will add the elements of an int[] using recursion. (The method should take two arguments, the array and an index.)

4. Non-recursive Tower of Hanoi - Write a method to solve the towers of Hanoi problem that doesn't use recursion.