Help asap, please!!! Thank you (analysis algorithms)

4. (20pts) You are given T(n)=2T(n/2)+cn. a) Which sorting algorithm's recurrence relation is T(n) ? b) Apply the iteration method to arrive at an upper bound for the above T(n). c) Apply the recursion-tree method to arrive at an upper bound for the above T(n)