Solve the following recurrence relations using the recurrence tree method; include a diagram of your recurrence tree. If the recurrence relation describes the behavior of an algorithm you know, state its name. T(n) = T([n/2]) + 1 T(n) = 2T(n/2) + n T(n) = 2T(n/2) + 1