points$)$ Create a structure that contains all the components needed to manage the list. Modify

the structure of the map entries to include pointer to the next item in the list. Modify the function

map init such that it initializes the array of structures, and any supporting structures you need.

This function should take $1$ argument:

$(1)$ a pointer to struct map list.

$($b$)(10$ points$)$ Modify map add from A$2$ to use the list structure. This function should find a node on

the free$-$list and add it to the end of the list. I