The merge sort algorithm is a recursive algorithm characterised by the

recurrence $T(n)=2T(\frac{n}{2})+cn($for some $c>0)$; here $n$ is the size of the array to

be sorted. Show that the worst running time is $(nlgn).$