In the array-based implementations of a list, insertion in the worst case and on the average has computing time O(__________).
a) O(n)
b) O(log n)
c) O(1)
d) O(n^2)