1. The problem statement, all variables and given/known data Find a tight upper bound for the recurrence relation using a recursion tree argument 2. Relevant equations T(n)=T(n/2)+T(n/3)+c 3. The attempt at a solution I don't know how to do this problem because the tree doesn't have symmetry. One side of the tree can keep going because of the lack of symmetry plus at the end there is no way that you get T(1). How do you solve this problem using a recursion tree?