In an array$-$based implementation of ListInterface, what is the time complexity of removing an entry from the end of the list when remove$()$ doesn't change the length of the array?

Group of answer choices

a$.$O$(1)$

b$.$O$($log n$)$

c$.$ O$($n$)$

d$.$ O$($n$2)$

e$.$none of the above