def sorter_one_level_depth(arr):
    return sorter(arr)


def sorter(arr):
    for i in range(len(arr)):
        for j in range(len(arr) - 1):
            if arr[j] > arr[j + 1]:
                temp = arr[j]
                arr[j] = arr[j + 1]
                arr[j + 1] = temp
    return arr

async def decompress_braces(string):
    numbers = "123456789"
    stack = []

    for char in string:
        if char in numbers:
            stack.append(int(char))
        elif char == "{":
            continue
        elif "a" <= char <= "z" or "A" <= char <= "Z":
            stack.append(char)
        elif char == "}":
            segment = ""
            while isinstance(stack[-1], str):
                popped_char = stack.pop()
                segment = popped_char + segment
            num = stack.pop()
            stack.append(segment * num)
    return "".join(stack)


async def sorter_one_level_depth_lower(arr):
    return sorter(arr)



def add_one_level_depth(a, b):
    return add(a, b)

def add(a, b):
    return a + b

def multiply_and_add(a, b, c):
    return a * b + c
