Match the collision handling technique with the scenario:

Question $5$ options:

$5$

Set of keys are static $($all are known and will not change at the beginning$)$

$8$

More insertions than the table size $($and keys are not known ahead of time$)$

$4$

Need to allow for deleting keys

$6$

Less insertions than the table size $($and does not need to support deletion and keys are not known ahead of time$)$

$1.$

Associative hashing

$2.$

Bogo hashing

$3.$

Double hashing

$4.$

Linear probing

$5.$

Perfect hashing

$6.$

Quadratic probing

$7.$

Quick hashing

$8.$

Separate chaining