Assume the hash function h$($x$)=$ x mod $13$ is used to calculate the hash table index location into which the following records with keys $18,41,22,44,59,32,31$ and $73$ will be inserted in that order. The keys will be the data inserted at the index location. Also assume linear probing is used to resolve collisions. What is the approximate load factor $\backslash$lambda of the table after the insertions? Check the closest answer.

Hash Table $-$ blank

$90\%$

$75\%$

$60\%$

$45\%$

$30\%$

$15\%$

None of the listed answers is correct