What is the big$-$O of the worst$-$case time cost of removing an element at the tail of a singly$-$linked list of size n$?$ Select the tightest bound that holds.