Homework number 4 - fibonacci sussquences.

Consider the generalized fibonacci sequences:
4, 1, 5, 6, 11, 17, 28, ...
3, 2, 5, 7, 12, 19, 31, ...
Write a program that takes two numbers as input and prints as many Sussmans as the tenth number in the resulting fibonacci sequence.
USE RECURSION.

>>15
Write two implementations of fib, so you can check your work¹. Even so, there might be a question, so you'd be best to write four implementations of fib. Interestingly, your confidence in your results based on the agreement of n fib implementations grows on the order of O(n²)².

_{1^{500 is correct.}
2^{This is not true.}}