Proving Merge Sort uses less than or equal to 2n * Log2(n) comparisons for every n >= 2 [closed]