write step by step im very confused

Mathematical Induction - Merge sort: T(n) =2T(n/2) + O(n), T(2)=2 - Guess T(n) is O(nlgn) - Verify the guess by induction Merge sort: T(n) =2T(n/2) + n Use Mathematical induction to show that when n is exact power of 2, the solution of the recurrence is e(nlgn) Thus, we want to show that T(n) 0 Inductive step