Choose an algorithm and write it in Python

mergeSort/MergeSort.py
def merge(arr, low, mid, high):
    size1 = mid - low + 1
    size2 = high- mid

    Left = [0] * (size1)
    Right = [0] * (size2)
    
    for i in range(0 , size1):
        Left[i] = arr[low + i]
    for j in range(0 , size2):
        Right[j] = arr[mid + 1 + j]
    
    i = 0    
    j = 0    
    k =...