This exercise is another variation on "instrumenting" the recursive Fibonacci program to better understand its behavior. Write a program that counts how many times the fib function is called to compute fib(n) where n is a user input.
Hint: To solve this problem, you need an accumulator variable whose value "persists" between calls to fib. You can do this by making the count an instance variable of an object. Create a FibCounter class with the following methods:
__init__(self) Creates a new FibCounter setting its count instance variable to 0.
getCount(self) Returns the value of count.
fib(self,n) Recursive function to compute the nth Fibonacci number. It increments the count each time it is called.
resetCount(self) Set the count back to 0