Question 2 (14 points) Use the recurrence tree expansion method to find an asymptotic tight bound to the following recurrence relation. For simplicity, as- sume that n is always a power of two and T(1) = 1. T(n) =T(1/2)+1