What is the running time for a list of n integers in notation? 5 2 2 5 merge 2 1 2 5 merge 2

What is the running time for a list of n integers in Θ notation?

5 2 2 5 merge 2 1 2 5 merge 2 7 sorted sequence 7 merge 3 4 5 merge 7 initial sequence 3 merge 6 3 7 2 3 merge 2 2 6 6 merge Figure 2.4 The operation of merge sort on the array A = (5. 2, 4, 7, 1, 3, 2, 6). The lengths of the sorted sequences being merged increase as the algorithm progresses from bottom to top.