Assume a list of the following node type:
struct gradeNode {
char lastName[ 20 ];
double grade;
struct gradeNode *nextPtr;
};
Assume that the list pointed to by startPtr is maintained in alphabetical order. (Note: you do not know what is in the list, only that it is maintained in alphabetical order.) Assume that newPtr points to the new node to be inserted. Write the code needed to insert the node into the list. Create any required pointers needed to complete the insertion.