[Lisonbee] Using the template provided, implement the function 'insert_node' that traverses a SORTED, singly linked list (least to greatest), and inserts a node into the correct spot that keeps the list sorted. Make sure that the new node is added properly and the integrity of the list is maintained. You can assume that 'list' is already initialized with a list of custom_node's that contain sorted data values, with the address of 'list' pointing to the head of the list, and the last node having a NULL next. You may also assume that the 'new_node' value will always be greater than the head of the list..