Overview In this lab, we create an application which allows the user to build a sorted list of strings. The program will perform the following action Prompt the enter 2. Call a function to insert that string, in alphabetic order, into a linked list. 3. the user did not enter a string, print the list in order and terminate. Specifications Use this structure and constant for the linked list node: #define MAx STR LEN 80 struct link node char node str MAX STR LEN struct link node next, Your solution should incorporate the following functions This function is used to compare two nodes. The return values are: //-1 nl n2 0: nl +1 nl n2 int compare node struct link node .nl, struct link node n2 This function is used to add a new node into the alphabetically sorted linked list. The head of the list is pointed to by list The return value is the (possibly new) head pointer. struct link node *add node struct link node .list, struct link node node