Extend the program in Problem so that new records can be inserted or existing records can be deleted.
Problem ,
Write a program to read the records from Student 1e (described at the end of Chapter 4) and store them in a multiply-ordered list with two link fields, in which one link is used to order the nodes so that the id numbers are in ascending order and another link orders the nodes so that the names are in alphabetical order.
Note that the records in Student 1e are already arranged in order of ascending id numbers.
Then search this list for a given student id or a given student name, and display the other information in the record.