Suppose you are implementing a dynamic set of student records as a hash table. Each record has an integer key. Key can have values from 0 through 65,536 and no two records can have the same key values. In addition to the key, each record has following information.

Name:

GPA:

Academic level:

Even though the key can take a value between 0 and 65536, this university can have max 10000 students at a given time.

Hash Table Implementation Details: Assume that the hash key is k mod m and using chaining in case of a collision. Also, the size (m) of the hash table is 1000. Also, you can assume that keys for student are generated using a random uniform distribution function.

Write a C or C++ program that Implements the hash table construction for the above scenario and then implement the following three functions

a) INSERT(T, x) // insert the student record x to the table

b) DELETE(T, x) // delete the student record x from the table

c) SEARCH(T, k) //search key k in the hash table

C Wil N Do wssystem 32cmd.exe ash Table Implementation 3EasEEaaaszs3ss3Es 1. Insert a Record (user enters the name, GPA, Academic level, Key (Key should be between e 65536 2. Search the table (user enter a key for search) Key should be between -65536 Delete a record (user enter a key of the decord to be deleted) enter your choice Press any key to continue