C language. I attached a basic overview on how the pointers work in this case and how the execution of the program works.

main.c and phone.h is already completed so I only need help with the following functions:

void printByFirst(MultiLinkedList *list) { // print traverse list in alphabetical order by first name return; } void printByLast(MultiLinkedList *list) { // print traverse list in alphabetical order by last name return; }

 MultiLinkedList *removeItem(MultiLinkedList *list, char *first, char *last) { // remove the individual specified from the list return ;} MultiLinkedList *updateFirst(MultiLinkedList *list, char *first, char *last, char *newFirst) { // update the first name of the individual specified return NULL; } MultiLinkedList *updateLast(MultiLinkedList *list, char *first, char *last, char *newLast) { // update the last name of the individual specified return NULL; }

MultiLinkedList Judy Garland 2058675309 nextFirs headFirstName headLastName Jack Haley 9707779311 nextFirst nextLast next Bert Lahr 8006492568 nextFirst NULL Roy Bolger 4796060842 NULL nextLast For this project, you will implement a set of basic linked-list functions that allow you to manipulate a list of phone numbers by both first name and last name. Each node in this linked list contains the following information: typedef struct node char *first; char *last; long number struct node *nextFirst / next item in list, ordered by first name struct node *nextLast / next item in list, ordered by last name // first name of the person // last name of the person // a ten-digit phone number 1 Node; You will note that this list has two pointers, one for the next item in the list by first name, one for the next item in the list by last name. The list of nodes is linked in two different ways. To manage the "head" of these two lists, we use a second struct that stores the "head" of the list using each of these two views by first" and "by last typedef struct mlist Node Node ?headFirstName ; ?headLastName; 1 MultiLinkedList; MultiLinkedList Judy Garland 2058675309 nextFirs headFirstName headLastName Jack Haley 9707779311 nextFirst nextLast next Bert Lahr 8006492568 nextFirst NULL Roy Bolger 4796060842 NULL nextLast For this project, you will implement a set of basic linked-list functions that allow you to manipulate a list of phone numbers by both first name and last name. Each node in this linked list contains the following information: typedef struct node char *first; char *last; long number struct node *nextFirst / next item in list, ordered by first name struct node *nextLast / next item in list, ordered by last name // first name of the person // last name of the person // a ten-digit phone number 1 Node; You will note that this list has two pointers, one for the next item in the list by first name, one for the next item in the list by last name. The list of nodes is linked in two different ways. To manage the "head" of these two lists, we use a second struct that stores the "head" of the list using each of these two views by first" and "by last typedef struct mlist Node Node ?headFirstName ; ?headLastName; 1 MultiLinkedList