Overview In this lab, we will create an application which allows the user to build a sorted list of strings. The program will perform the following actions 1. Prompt the user to enter a string 2. Call a function to insert that string, in alphabetic order, into a linked list. 3. If 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 struct link node 80 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: // 0: nl- n2 // +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 1ink node *list, struct link node *node )