2. Binary Recursion. (15 points) Consider the following recurrence: T(n)- 2T(n -2)+2 (a) Use the recursion tree method to determine an upper bound on T(n). (b) Verify your answer using the substitution method. Use your answer in (a) as the starting guess