Question

For small a > 0, we can find large N >0:
then​

Answer 1

Answer:

n refers to the size of the input, in your case it's the number of items in your list. O(n) means that your algorithm will take on the order of n operations to insert an item. ... O(1) means it takes a constant time, that it is not dependent on how many items are in the list.

Explanation:

make me as brainlist