Using division method for a hash function h and a hash table of size m,

store your data of student IDs (n= 20) in an array of records not sorted.

h (k) = k mod m

m : A prime number between 2**4 < m < 2**5 and not too close

to the power of 2 (e.g. 23)

Read 20 6-digit student IDs from array of records

And mapped them to hash table using linear probing

Print out hash table

Do minimum two searches one with ID found and the other one with ID not found