Question $1$

$1$ pts

In the array$-$based implementation of a list, which has size n $,$ insertion in the worst case has computing time.

$O(n^2)$

$O(n)$

$O(1)$

$O(logn)$