Opening the paper…
Figure from the original question paper A list of n strings, each of length *n* , is sorted in lexicographic order using the merge-sort algorithm. The worst case running time of this computation is\_\_. Figure from the original question paper