The following declarations are exactly the same as the ones used in the file lists.h that was discussed in class. typedef struct node node_t; struct node { data_t data; node_t *next; }; typedef struct { node_t *head; node_t *foot; } list_t; A student wrote the following function to reverse the nodes in a list by reassigning all the pointers, so that the node (and data item) that used to be at the head of the list is now at the foot, and the node (and data item) that used to be at the foot of the list is now at the head. But four of the student's assignment statements have been lost. list_t *reverse(list_t *list) { node_t *curr, *prev, *next; assert(list); prev = NULL; curr = list->head; while (curr) { // line A // line B // line C curr = next; } list->foot = list->head; // line D return list; } Match the line locations on the left with the correct assignment statements on the right. 1: line A 2: line B 3: line C 4: line D