1. (5 points) You are implementing a hash table using chaining with linked lists where each node is of the following type. struct nodef char* key; char* value; struct node next; di Given that the hash table is implemented as an array of pointers to hash table nodes, implement the following hash search function to search a key in the hash table. If the key is found, the search function returns the char* value associated with the key and returns NULL otherwise. The value MAXENTRIES is the number of buckets in the hash table. Your code should carefully handle al corner cases, should compile, and should not experience segmentation faults on any input. You can assume that the hash function is already provided in the library and has the following prototype as shown below: int hash_function(char*) struct node * hashtable [MAX_ENTRIES] char* hash_search (char* key)(