Exercise 3. What is the asymptotic upper bound (big O) of the following recurrence relation? For this exercise, you do not need to use substitution method or recursion trees. The goal is to practice the relations that do not have a straightforward format. So, showing the solution by a few lines suffices. Hint: Think about how to simplify the relations by changing variables (c). (6 points) a. T(n)=T(n1)+O(n) b. T(n)=2T(2n+17)+n c. T(n)=T(n])+logn