Analyzing Merge Sort Algorithm

• Repeating the process k times:    T(n) = 2^kT(n/2^k) +5nk
• since n = 2^m, when k = m:    T(n) = 2^mT(n/2^m) +5nm
• T(n) = nT(1) +5nm
• T(n) = n + 5nlog₂(n)