Question 3: (6 marks) Although big-O notation determines a growth rate of a function, sometimes a worse algorithm may outperform a better algorithm for very small input sizes n. Consider each of the following big-O estimates f(n) for algorithm A and g(n) for algorithm B, all of which g(n) O((. For each instance of f and g, find the smallest integer input n beyond which, algorithm B will always outperform algorithm A. Show your work. For this question, you may use algebra, a graphing calculator or online resources to justify your answer. a) b) c) g(n)= 4x1082(n) g(n) = 100 n log2(n) g(n) = 6 ns f(n)2 f(n) = f(n) = n6