Problem:
Question- Write a program to implement the linear probing. The hash table has 13 buckets, numbered from 0 to 12, and the hash function is hash(key)= key % 13. Each bucket is associated with a "neverused" field as described in the textbook.
Part 1- The keys 9, 10, 22, 35, 11, 23, 2, 4, 15, 16, 48, 28, are inserted in order into the hash table. Show how the keys are distributed in the table at the end.
Part 2- Delete the keys 22, 2, 11, 35, 28. Show the resulting table.
Part 3- Search for the keys: 2, 4, 28 in the table.
Show the code, demonstrate it works properly and describe what it is doing.