Please explain the reason, thanks.

Incorrect Question 1 0/1 pts If a stack is implemented as ... an array then the preferred implementation uses a circular array. an array then add is O(n) worst case. a linked list then add to end and remove from end. an array then add and remove are O(1), provided capacity is not exceeded