Answer the following questions using the simplest possible o notation unless otherwise stated. Assume in recurrences that f(n) is (1) for constant values of n. Solution to the following recurrence relation: f(n) = 3f(n 1) - 2f(n 2) + 2". For this problem, give your answer in big-O nota- tion