val val > val)1011break;12succ = succ->next;13}struct node * this = malloc(sizeof (struct node));this->val = val;141516this->next = succ;17if (pred != NULL) {pred->nextreturn first;}...

Extracted text: Question 1 The code below defines a singly-linked list. This consists of the following definition of node: 1 struct node { int val; struct node * next; 4 } Also, it uses the following insert function: struct node * insert(struct node * first, const int val) { 6 struct node * pred = NULL, * succ = first; 7 while (succ != NULL) { 8 if (succ->val < val)="" pred="succ;" if="" (succ-="">val > val) 10 11 break; 12 succ = succ->next; 13 } struct node * this = malloc(sizeof (struct node)); this->val = val; 14 15 16 this->next = succ; 17 if (pred != NULL) { pred->next return first; } else { 18 this; %3D 19 20 21 return this; 22 } 23 } Note that the code above compiles correctly. (a) Give an implementation in C for a function that prints all values in the singly-linked starting from the first node and following the next node one by one along the list. Use the following signature: void print (struct node * first);