<prompt> Tumia kuunganisha aina katika Python  <response>: Here is the implementation of Merge Sort in Python: Merge Sort Algorithmdef mergeSortarr: if lenarr 1: mid lenarr 2 L arr:mid R arrmid: mergeSortL mergeSortR i j k 0 while i lenL and j lenR: if Li Rj: arrk Li i 1 else: arrk Rj j 1 k 1 while i lenL: arrk Li i 1 k 1 while j lenR: arrk Rj j 1 k 1 Driver Codearr 12, 11, 13, 5, 6, 7mergeSortarrprintSorted array is:, arrIn this implementation, the mergeSort function is recursively called on the left and right halves of the input array until the length of each sub-array is 1 or less. The actual sorting is done in the merge function where the two sub-arrays are combined in a sorted order. Finally, the sorted array is returned. 