Consider the recurrence T(n) = 2T(n-2) + n.

Part A : Draw the recursion tree for this relation.

Part B: How many levels are in this recursion tree, as a function of n?

Part C: How many problems are there at the bottom of the recursion tree, as a function of n?

Part D: Write and solve the equation for the running time T(n) of this recurrence.