sequences fig merge sort snapshot fig merge sort merges algorithm is not ( to see whyconsider sorting the list [ after repeatedly splitting the lists we get down to lists of size one as depicted in the first list of fig the individual items are merged two at time to form sorted lists of twoshown in the second list of items while there are four merges that take place at the lowest level of the merge sortthe four merges are each for lists of two elements ( one from each listand together they form list of items so we can group all these four merges together to find that all the merges at that deepest level take (ntime not eachbut all of the merges at the deepest level when combined are (nthis copy belongs to 'acha