2) Suppose we have a singly linked list implemented with the structure below and a function that takes in the head of the list. typedef struct node I int num; struct node next; 3 node; current = other->next; if (current == NULL) 1 head > next = temp; return head; other->next = current->next; current->next = temp; return head; \} If we call whatDoesitDo(head) on the following list, show the list after the function has finished. head 123456>7