Answers for Lab 10

1. Running times of iterative Fibonacci

	n      Time
	-------------
	20
	30
	40
	45
	50

	Running times of recursive Fibonacci

	n      Time
	-------------
	20
	30
	40
	45
	50

2. How many calls are made to rfib when the value of the parameter n is 2? 

3. Explain why the recursive algorithm for computing Fibonacci numbers is so slow compared with the iterative algorithm.

4. Explain why it is difficult to design an iterative algorithm that computes the Abo series.