def merge_sort(arr): if len(arr) 1:
mid = len(arr) // 2
left_half = arr[:mid]
right_half = arr[mid:]
merge_sort(left_half)
merge_sort(right_half)
i = j = k = 0
while i len(left_half) and j len(right_half):
if left_half[i] right_half[j]:
arr[k] = left_half[i]
i += 1
else:
arr[k] = right_half[j]
j += 1
k += 1
while i len(left_half):
arr[k] = left_half[i]
i += 1
k += 1
while j len(right_half):
arr[k] = right_half[j]
j += 1
k += 1
return arr
arr = [1, 0, 2, 9, 3, 8, 4, 7, 5, 6]
print("Original array: ", arr)
sorted_array = merge_sort(arr)
print("Sorted array: ", sorted_array)
What is the output of the following python program