NAME: 1. Solve the recurrence T(n) = 2T(n/3) + 1 usin g the recursion tree method. Express your answer in the e-notation. In the recursion tree method, you . draw a recursion tree, e determine its height, estimate the work associated with nodes at each level, and simplify the summation to come up with a closed-form expression for the running time. (1) and that n is a power of 3. Assume that T(1) Solution