Python Program a method merge_sort(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given a = [1,3,5,6,10] b = [1,4,6,8] the resulting array should be: c = [1,1,3,4,5,6,6,8,10] The program should be implemented WITHOUT using any python libraries such as NumPy or other libraries. This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c.

#Python

Program a method merge_sort(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given
a = [1,3,5,6,10]
b = [1,4,6,8]

the resulting array should be:

c = [1,1,3,4,5,6,6,8,10]

The program should be implemented WITHOUT using any python libraries such as NumPy or other libraries.

This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c.

merge_sort(a,b) :