added answers to recursion exercises
my compute() version for fibonacci is infinitely faster that the
textbook version F(n).