code: def merge(left, right, merged):
      
  
      left_cursor, right_cursor = 0, 0
      while left_cursor < len(left) and right_cursor < len(right):
          # Sort each one and place into the result
          if left[left_cursor] <= right[right_cursor]:
              merged[left_cursor+right_cursor]=left[left_cursor]
              left_cursor += 1
          else:
              merged[left_cursor + right_cursor] = right[right_cursor]
              right_cursor += 1
      # Add the left overs if there's any left to the result
      for left_cursor in range(left_cursor, len(left)):
          merged[left_cursor + right_cursor] = left[left_cursor]
      # Add the left overs if there's any left to the result
      for right_cursor in range(right_cursor, len(right)):
          merged[left_cursor + right_cursor] = right[right_cursor]
  
      # Return result
      return merged
docs: Merge helper
          Complexity: O(n)