Step 1. Create a structure that has the following data members:
int id;
char major[35]
float gpa;
Now create a node stucture with the appropriate members. Also write main and include the decleration head. Next write the appropriate CreatNode function.
Step 2. Expand the program by including a function that prepends a node to the list. Ignore the memory leaks for now.
Step 3. Expand the program by including a function that appends a node to the list. Ignore the memory leaks for now.
Step 4. Expand the program by including a function that inserts a node into the list ordered by the id member. Ignore the memory leaks for now.
Step 5. Expand the program by including a function that displays the contents of the linked list. Ignore the memory leaks for now.
Step 6. Add the capability to the program to delete the end node.