Which of the following is TRUE about chained hash table operations? $($Select all that apply.$)$

Group of answer choices

find is an O$(1)$ operation on average, but is O$($n$)$ in worst case

insert is always an O$(1)$ operation

remove is always an O$(1)$ operation

insert adds an element to the end of the corresponding linked list in an array cell

none of these