Task:

Write the code for the insert$\_$node function at line $204.$ This function should insert a node into a list in alphabetical order, like entries in a phonebook. It should work correctly whether inserting at the beginning, middle, or end of the list.

The list is created in the main$()$ function, but the last three composers are added to the end instead of being inserted alphabetically.

Change #define ALPHABETICAL $0$ to #define ALPHABETICAL $1($line $14)$ to activate the section of the code you wrote.

Ensure that the insert$\_$node$()$ function works correctly and add any necessary code to implement file output $($add fopen$(),$ fclose$(),$ fprintf$()).$

Hint: Implement the find$\_$node$()$ and remove$\_$node$()$ functions.

Rewrite:

Task:

Implement the insert$\_$node$()$ function at line $204.$ This function should correctly add a new node to a list in alphabetical order, mimicking entries in a phonebook. It should handle insertions at the start, middle, or end of the list seamlessly.

Although the list is initialized in main$(),$ the last three composers are appended instead of being sorted alphabetically.

Switch #define ALPHABETICAL $0$ to #define ALPHABETICAL $1($line $14)$ to enable the section of code you've written.

Ensure that insert$\_$node$()$ operates correctly and include any necessary code to output to a file $($use fopen$(),$ fclose$(),$ fprintf$()).$

Hint: Develop the find$\_$node$()$ and remove$\_$node$()$ functions as well.