A given a hash table of an array with a size of $9.$ Use the Compression function$=k\%.$

Insert the keys: $3,5,24,22,9,10$ into your table $($in that order$).$ Use linear probing method whenever you face the collision problem.

$\backslash$table$[[0,1,2,3,4,5,6,7,8],[,,,,,,,,]]$