Considering collision handling approaches for hash tables, it is correct to say:

Group of answer choices

Deletion of an item can always be performed in O$(1)$ time when using linear probing.

Deletion of an item can always be performed in O$(1)$ when using separate chaining.

Deletion of an item can always be performed in O$($n$)$ time.

Double hashing facilitates item deletion in comparison with linear probing.