Please give a clear answer.

6. (4 pts.) Recall the MergeSort recurrence: T(n)-2T(n/2)+n. Prove by induction on n that T(n) nlogn + n when " is a power of 2 (i.e. n=2) Having proved the inequality, what does this imply for the big-O bound for Mergesort