Match the WORST case efficiency for the following operations $($assuming the scenario is appropriate for each collision handling technique$)$:

Question $6$ options:

$1$

Inserting an item into a hash table using perfect hashing

$2$

Inserting an item into a hash table using separate chaining

$1.$

O$(1)$

$2.$

O$($ n $)$

$3.$

O$($ n log n $)$

$4.$

O$($ n$^2)$

$5.$

O$($ n$!)$

$6.$

Load factor alpha