Question 1 The code below defines a singly-linked list. This consists of the following definition of node: 1 struct node { 2 int val; 3 struct node * next; 4 } Also, it uses the following insert function: 5 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 > val) 11 break; 12 succ = succ->next; 13 } 14 struct node * this = malloc(sizeof(struct node)); 15 this->val = val; 16 this->next = succ; 17 if (pred != NULL) { 18 pred->next this; 19 return first; 20 } else { 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); [3 marks]