Profile the performance of the memoized version of the Fibonacci function defined in Project 6. The function should count the number of recursive calls. State its computational complexity using big-O notation, and justify your answer. The fib function header has been modified to include the counter as the second parameter. Define the Counter class, it should have three methods: __init__, increment, and __str__. When an instance of the Counter class is passed as a parameter, the count property of that instance should be incremented based on the number of recursive calls. The __str__ method should return the count property's value as a string. -----------------------------------------------------------------------------------   """ File: fib.py Project 11.7 Employs memoization to improve the efficiency of recursive Fibonacci. Counts the calls and displays the results. """ class Counter(object):     """Tracks a count."""     # Define the Counter class here. def fib(n, counter = None):…

Profile the performance of the memoized version of the Fibonacci function defined in Project 6. The function should count the number of recursive calls. State its computational complexity using big-O notation, and justify your answer. The fib function header has been modified to include the counter as the second parameter. Define the Counter class, it should have three methods: __init__, increment, and __str__. When an instance of the Counterclass is passed as a parameter, the countproperty of that instance should be incremented based on the number of recursive calls. The __str__ method should return the countproperty's value as a string. Please can you change the solution to this problem here, because this is wrong. """ File: fib.py Project 11.7 Employs memoization to improve the efficiency of recursive Fibonacci. Counts the calls and displays the results. """ class Counter(object): def__init__(self,count=0): self.count=count defincrement(self): self.count+=1 def__str__(self):…

Explain encapsulation briefly