How to analyze the merge sort algorithm in C++?

Question

I mean I want to write the merg sort and merg function then according to them demonstrate that the time complexity of that is nlgn according to the merg sort and merg functions, please help me.