You are inserting keys in a hash that uses linear proving as a way to handle collisions. The hash table has $9$ slots and the has function is h$($k$)=$ k mod $9$ and the probing function is f$($i$)=$ i$,$ where I $=0,1,2,3,4,...$

h$\text{'}($k$)=$

mod $9$

Keys to be inserted: $5,28,19,15,20,33,12,17,10$

Using the above information, what will be the key inserted on slot $0($Assume a zero$-$based array$).$

Question Answer

$17$

$19$

$12$

$10$