Hi, can anyone describe this Code with the following question.. New version Just Describe in python. An algorithm that sorts key-value entries by key is said to be straggling if, any time two entries ei and ej have equal keys, but ei appears before ej in the input, then the algorithm places ei after ej in the output. Describe a change to the merge-sort algorithm in Section 12.2 to make it straggling.

#section 12.2

def merge_sort(S):

n = len(S)

if n < 2:

return

mid = n // 2

S1 = S[0:mid]

S2 = S[mid: n]

merge _sort(S1)

merge _sort(S2)

merge results 14 merge (S1, S2, S)