In an array$-$based implementation of the ADT list, what is the worst case performance of the remove method?

Group of answer choices

O$(1)$

O$($log n$)$

O$($n$)$

O$($n$^2)$