Need help on this one! thx

Choose all that are true about hash tables. Ja. In the double hoshing method, the same hash function is applied twice on a key to map the key to a hash table. b. When two distinct keys are mapped to the same location in the hash table, it is called collision. C. The division hash function (or division method) uses an integer division operator. Ud. One of disadvantages of the linear probing is that it may create a clustering, which are contiguous occupied locations in a hash table