() Given the following structure definition: \( \begin{array}{l} \text { struct node_st }\{ \\ \text { int data; } \\ \quad \text { struct node_st } * \text { next; } \\ \} ;\end{array} \) Write a C function, sorted_insert_list(), that takes an integer argument, num, and a linked list, list, (possibly NULL) of these structures sorted in ascending order. sorted_insert_list() creates a new node with the given value and inserts it in the list so that all the data values in the list remain sorted. sorted_insert_list() returns a pointer to the head of the new list. Write robust code. struct node_st sorted_insert_list(int num, struct node_st list) \{