Can someone implement a hashtable using the following function definitions and structs. DO NOT CHANGE THE PARAMETERS OF THE FUNCTIONS OR THE STRUCT ITSELF. I personally have trouble with when there are two nodes saved at DIFFERENT KEYS but AT THE SAME POSITION. Also, i cant seem to figure out how to destroy table with seg faulting it. THANK YOU IN ADVANCE!

typedef struct Node int key void dat struct Node next Node typedef struct HashTable size t size; Node able void destroy DataFunction) void data) int hashFunction) (size t able Size nt key void print Function) (void wtoBe nted Table Table create Table (size t size, int (WhashFunction) (size t tab nt key void destroy Data void data) void print Data) void to Be Printed Node wcreateNode (int key, void data); void destroy Table (HTable ash Table void insertData (HTable whashTable, int key, void data) void remove Data (HTable whashTable, int key) void lookup Data (HTable whashTable, int key)