What in the following are Set ADT operations?

Given that there are

Given a numeric algorithm taking an arbitrary integer n as input, with respect to what should its complexity be analysed?

Estimate the complexity of the following function in terms of the input integer n:

def mystery(n: int) -> int:
    result = 0
    for i in range(n):
        for j in range(i):
            result += i * j
     return result

Is Insertion Sort Incremental?

Is Bubble sort stable?

Given an algorithm taking a list of n strings as input such that each string is limited by a fixed number of characters, with respect to what should its complexity be analysed?

Estimate the complexity of the following function in terms of the input integer n:

def mystery(n: int) -> None:
    result = 0
    for i in range(n):
        for j in range(100000000):
            result += i * j
    return result

Is Selection Sort Incremental?

Given that there are n items in a list to sort, what's the maximum number of swaps for Selection Sort per iteration?