Your problem affords a great chance to contrast 2 basic approaches to calculating the Fibonnaci numbers.
Iterative (using a loop) vs recursive (your version).
With the recursive approach I couldn't see any way except to calculate each fib(n) from scratch and output the values in a loop. This involves making n calls to the recursive version of Fibonnaci(). If anyone can show a way to do the output as the function is run once please do.
With the iterative solution the value is built up directly, allowing the intermediate values of fib(n) to be output as fib(a) is being calculated once. This is much more efficient so an iterative approach seems better for this particular problem.
I've always used the Fibonacci problem as an example of when a look-up table can be valuable as well. Most professors overlook this third solution though.
If he writes stuff like that it's obvious he didn't even attempt checking his post for errors. Of course not everyone can speak or write perfect english, but -especially if your english is bad - at least checking for spelling is mandatory. And I doubt his english is so bad that he couldn't have expressed himself better than this.