3. Draw the recursion tree for: T(n) -T(n -2) +T(n/2)+n, and provide a tight asymptotic bound on its solution. Verify your answer with the substitution method. 3. Draw the recursion tree for: T(n) -T(n -2) +T(n/2)+n, and provide a tight asymptotic bound on its solution. Verify your answer with the substitution method