check duplicate entries for address book using hash table in c (need to be done within 24 hours)

A mailing list is a collection of people’s names and addresses, used for bulk mailings. Mailing lists from different sources are often merged. A merged mailing list might contain duplicate entries, with only trivial differences, such as alternative forms of names, missing parts of addresses, etc. Duplicate entries result in excessive postage costs, and irritation for recipients of multiple copies of a single mailing. A program is required to report potential duplicate entries in a given mailing list. You are to implement mentry.c and mlist.c. The implementations must match the function prototypes in the headers listed in section 3 above. The implementation of mlist must be a hash table. For full credit, the hash table must resize itself whenever any one hash bucket exceeds 20 entries. You should print diagnostics on stderr whenever you have to resize the table.