By using merge sort?

Question

let there are n elements in array and number of sorted sub array is logn of size (n/logn) each then what is the time complexity to solve the given array

Answer 1

Is their any change in complexity as their are some sorted sub array?