Implement a hash table in C++, using collision resolution by chaining.
Your hash table must store a list of names and registration numbers. Thereafter, you must be able to search for a particular name and find the associated registration number.
Use the division method (read the prescribed text) for your hash function.
Use an array with 10 elements as your hash table.
Insert sufficient elements into the hash table to test its ability
to successfully create chains of elements.
Remember to include a method to dispose of the hash table after use.