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

Question

Does anyone know how to consruct a proof by induction that proves MergeSort uses less than or equal to 2n*Log(n) comparisons for every n >= 2?

We assume that Merge