Description

solve three questions need follow the instruction

Use the recursion-tree method to solve the following recurrence:
T(n) = 2T(n/2) + nlgn.
You can assume that T(1) = 1 and that n is a power of 2 for convenience. Show your
steps and give your solution using big-O notation.