def merge(a, b):
    left = list(a)
    right = list(b)

    def merge_lists(first, second):
        merged = []
        i = 0
        j = 0

        while i < len(first) and j < len(second):
            if first[i] <= second[j]:
                merged.append(first[i])
                i += 1
            else:
                merged.append(second[j])
                j += 1

        while i < len(first):
            merged.append(first[i])
            i += 1

        while j < len(second):
            merged.append(second[j])
            j += 1

        return merged

    def merge_sort(values):
        if len(values) <= 1:
            return values

        middle = len(values) // 2
        left_sorted = merge_sort(values[:middle])
        right_sorted = merge_sort(values[middle:])
        return merge_lists(left_sorted, right_sorted)

    return merge_sort(left + right)