Will need 3 different C programs, can be commented out in the c file unless it needs to be activated.

Searching and Sorting The auxiliary pointer aux will be declared and initialized to head. Node aux = head; The end condition for the while loop (a while loop is recommended) should be aux->next != NULL ; The update of aux should simply be: auxauz->next; The comparison can be made in whatever manner is required. This includes the use of = and stremp OK, here is a simple problem for you to do now during the lab. Given the array of strings beatles[whose contents include "john", "paul" "george" and "ringo", build a search function called search) that will search the list for names to see whether they were one of the Beatles or not. Start with char beatles[4]-"john", "paul", "george", "ringo") Now write a search function to search this array and see whether "george" and "ringo" are in that list. Then check to see whether "mick" and "rce are on that list