Show a complete function insert_inorderlist() to insert data in ascending order into the linkedlist. You must consider the following cases:

• use pointer named current to traverse the list
• use pointer named before to point before the current node
• The list is initially empty
• The new data is smaller than the smallest data in the list
• The item to be inserted somewhere in the list
• The new data is larger than all data in the list