Prove by induction that the worst-case runtime of Merge Sort is O(nlog(n)).

T(n)=cnlog(n), where c is constant