static hash table

demonstrates the following functionality of a static hash table
 * add a new entry
 * delete an entry
 * search an entry
 * modify the key for an entry
 * modify the attributes for an entry

this hash table employs chaining strategy for overflow management

For full problem statement, please refer:
 Fundamentals of Data Structures in C
 Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed
 Section 8.2 Static Hashing
 Exercise 13

CODE NOT TESTED YET. Hash Table functions have been coded but not
tested.