For this project, you will implement a data abstraction called a hash map in C using the header file below. This version will map strings to arbitrary values. You will implement it as a utility that can be compiled with and used by any application. You will turn in your code in a file named strmap.c$.($If you can please implement the function strmap$\_$put, strmap$\_$get, and strmap$\_$remove$).$

#include $//$ for printf, ONLY IN strmap$\_$dump

#include $//$ for strcmp

#include $//$ for malloc$/$calloc

#define MAX$\_$BUCKETS $10000$

#define MIN$\_$BUCKETS $10$

typedef struct strmap$\_$e $\{$

char $*$sme$\_$key;

void $*$sme$\_$value;

struct strmap$\_$e $*$sme$\_$next;

$\}$ smel$\_$t;

typedef struct sm $\{$

smel$\_$t $**$strmap$\_$buckets; $//$ array of pointers to elements

unsigned int strmap$\_$size; $//$ # elements in the table

unsigned int strmap$\_$nbuckets; $//$ size of the array

$\}$ strmap$\_$t;

$/*$ Create a new hashtab, initialized to empty. $*/$

strmap$\_$t $*$strmap$\_$create$($int numbuckets$)$;

$/*$ Insert an element with the given key and value.

$*$ Return the previous value associated with that key, or null if none.

$*/$

void $*$strmap$\_$put$($strmap$\_$t $*$m$,$ char $*$key$,$ void $*$value$)$;

$/*$ return the value associated with the given key, or null if none $*/$

void $*$strmap$\_$get$($strmap$\_$t $*$m$,$ char $*$key$)$;

$/*$ remove the element with the given key and return its value.

Return null if the hashtab contains no element with the given key $*/$

void $*$strmap$\_$remove$($strmap$\_$t $*$m$,$ char $*$key$)$;

$/*$ return the # of elements in the hashtab $*/$

int strmap$\_$getsize$($strmap$\_$t $*$m$)$;

$/*$ return the # of buckets in the hashtab $*/$

int strmap$\_$getnbuckets$($strmap$\_$t $*$m$)$;

$/*$ print out the contents of each bucket $*/$

void strmap$\_$dump$($strmap$\_$t $*$m$)$;