Which of the following best describes the collision resolution mechanism used in a chaining hashtable?

Keys with a duplicate hash after modulus will have a new location computed using a modulus with a prime slightly larger than it$.$

Keys with a duplicate hash after modulus will be added to the index next to the original hash index.

Keys with a duplicate hash after modulus will be added to the same index, and collected together inside of a list.

Keys with a duplicate hash after modulus will be discarded, and the value will be added to the original key that had that hash.