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. each record has an integer key key can have aues from 0thirougn osss0cords name: gpa academic level: even though the key can take a value between 0 and 65536, this university can have max 1 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