Ex 3.28 Recurrences any method Use the recursion tree method to solve the following recurrence equations with exact answers when leasible and answers that are within a constant factor of the exact solution if necessary A(n) = n + 2A(3), n > 1. B(n) = n + 3B(3), n > 1. D(n) n2+9D(3), n > 1