\( \begin{array}{ll}\text { () Given the following structure definition: } & \text { struct node_st }\{ \\ & \text { int data; } \\ & \text { struct node_st } * \text { next; } \\ & \} ;\end{array} \) Write a C function, sorted_insert_node(), that takes a pointer to a NULL-terminated sorted linked list (possibly empty) made up of these structures and an integer, num. Sorted_insert_node() creates a new node with data field of num and inserts it into the list in sorted order and returns a pointer to the head of the modified list. The list is sorted in ascending numerical order of the nodes' data fields. struct node_st sorted_insert_node(struct node_st 1, int num) \{