Collisions can be completely avoided in a hash table by choosing a perfect hash function. Group of answer choicesTrueFalse

Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored.OptionsFalseTrue

A good hash function should distribute keys uniformly across the hash table. Group of answer choicesTrueFalse

he problem of collisions in hash algorithms relates to a mathematical problem called the ______________.This type of question contains radio buttons and checkboxes for selection of options. Use Tab for navigation and Enter or space to select the option.optionABirthday ParadoxoptionBMessage DigestoptionCSecure HashoptionDInstruction Pointer

Consider a hash table with 11 slots. The hash functionis h(k) = k mod 11. The collisions are resolved byopen Hashing(Chaining). The following 11 keys are inserted in theorder: 28, 19, 15, 20, 33, 30, 42, 63, 60, 32, 43. Themaximum, minimum, and average chain lengths in thehash table, respectively, are-

Double hashing is generally more efficient than linear probing in terms of collision handling.Group of answer choicesTrueFalse