Pointers, Linked Lists, and Dynamic Data

Build a file to contain the attached student information. Each line of the file contains: student last name, student id, and test scores[4]. Utilizing the data in this file, create an internal database of student information by developing a linked list maintained in ascending order by name. In addition to the link information required for each node of the linked-list, each node is to contain the following three members: string name; string id; int *scores; The student scores are not stored per se in the node, but rather are held in their own dynamically acquired storage established while populating the student information into the database. After the program has established the database, it should then announce such to the terminal user and invite input. The supported input requests are: Display ALL, produces a report showing all students currently in the db, along with their id, and their average test score for the 4 tests; Display STUDENT NAME, for the student identified, list name, id, and their average test score; Remove STUDENT NAME, delete all maintained information relating to the identified student; and END, end the program. Input requests are continued to be solicited until the user submits an "END" The file to be used is: Jones 01324657 76 84 92 91 Williamson 87695991 70 60 80 83 Mattelmaier 65478825 56 65 61 66 Thompson 32378825 88 86 82 92 Olivera 9978865 77 87 76 80 Zenka 35378724 85 85 86 88 Archibald 65466725 90 92 77 88 Newmaster 86560021 71 68 66 70 Andersen 65361755 89 93 95 95 Swenson 45986502 74 77 77 82 ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Deadline information This is due 11/27/01 at 5:00pm