Consider a hash table of size 13 strong entries with integer keys. Suppose the hash function is h(k) = k mod 13. Insert in the given order entries…

Consider a hash table of size 13 strong entries with integer keys. Suppose the hash function is h(k) = k mod 13. Insert in the given order entries with keys 10, 3, 6, 16, 17, 19 in to the hash table using linear probing to resolve collisions. Show all the work.