Implement a 5-item hash table using the hash function:
h(i)=(2i + 3) mod 5
to hash the keys 12, 44, 13, 88, 23, 39, and 5. You should handle the collisions by chaining with linked lists. The program should get keys from the standard input (you cannont use hard-coded key values insude the program). The program should draw the updated hash table after each insertion. For example, if 5 keys have been inserted into the table, and if KeyA is in table index 0, KeyB and KeyC are in the table index 1, KeyD, KeyE, and KeyF are in the table index 2, then the resulting table should be:
1 KeyB -> KeyC
2 KeyD -> KeyE -> KeyF
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
Needs to compile and run on Microsoft Visual C++ 6.0