Can someone implement a hash table with the following function definitions without changing any parameters or structs. Please include a few test cases as well.

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)