What is the worst-case time complexity of the following function assuming it is measured on value n rather than its logarithmic size?

from array_sorted_list import ArraySortedList
from sorted_list_adt import ListItem
def mystery(n: int) -> None:
    my_list = ArraySortedList(n*10)
    for i in range(n*10):
        my_list.add(ListItem(n, i))    # assume ListItem(n, i) is O(1)
        # ListItem(value, key) adds based on key
    for i in range(n, n*10):
        my_list.delete(ListItem(n, i))

Testing every part of a program both in isolation and as part of an integration of new code into the whole is called __ testing.

The type of an object is called its __ type.

OO programming is __- centric (either of two answers).

The acronym for the true multiprocessing situation where the data set is carved up into discrete sets, each of which is operated on by the same code is

In most OO circumstances,stances object properties (including memory) are generated dynamically. This is called

In Modula-2, class members are protected by default. To make them public that need to be listed in a ___ clause.

Another word for const or static or final used in the sense of readonly is__.

The C++ scope reentrant operator is written

In ISO Module-2 garbage collection is the responsibility of