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

1. Reachable Nodes - Write a method that will work in the graph scenario after you have read in a graph from file. The method should go in a Node and when you call it from that Node, it should remove all the Nodes from the world that you can reach from that Node.

2. 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.

3. Recursive Printing - Write a method that will print a count-down. It should take a single integer and then print from that number down to zero. It needs to do this with recursion, not a loop.

4. Within Range - Write a method that will work in the graph scenarion after you have read a graph from file. The method will go in a Node and take an integer as an argument. When you call it, it shoudl remove all nodes that you can reach from the current node the the specified cost or less.