Construct a merge function that recursively splits a numeric array and takes a list as a parameter called data.
Consider that merge_sort() function is already defined and given below.
def merge_sort(left, right):
result = []
i, j = 0, 0
while i < len(left) and j < len(right):
if left[i] <= right[j]:
result.append(left[i])
i += 1
else:
result.append(right[j])
j += 1
result += left[i:]
result += right[j:]
return result