CCCS224 Data Structures Program Description: Write a program to save a list of students records and then perform several operations on this list Your program will ask user to choose the option from a menu. The 5 major function in menu are: ADDSTUDENT STUDENTINFO id DELETESTUDENT id FINDLARGEST PRINTLIST REVERSEPRINTLIST Exit How it Works The menu is handled by do while and switch statement Sample output **** STUDENT MANAGEMENT SYSTEM**** 1 --->Press '1' to ADDSTUDENT: 2--->Press '2' to STUDENT INFO id : --->Press '3' to DELETESTUDENT id: --->Press '4' to FINDLARGEST : 5--->Press '5' to PRINTLIST: --->Press '6' TO REVERSEPRINTLIST: ->Press '7' to exit: Implementation: For this program you will create the following classes: Student.cpp: This class will be used to create objects of type student. Each student object will store student information (name, ID, GPA). StudentList.cpp: This class will be used to create a linked list with nodes of type Student. All the methods will be implemented in this class. Projecti.cpp: This is the class that will contain main. Page 2 CCCS224 Data Structures The Methods to be implemented are as follows: 1. ADDSTUDENT This method will add a new student to the list. It takes 3 parameters ( student name, id, and GPA). Your program must ask the user to enter the details of new students: Name, ID and GPA Example Input: ADDSTUDENT Rana Salah 1000000 4.2 Example Output The student record was added successfully 2. STUDENTINFO id This method will search for a student with his/her id. If the student is found it will print her/his record to the output. If the student is not found it will print "There is no record of this student in this system" Example Input: STUDENTINFO 1712371 Example Output Student nameRaged Alshibri Student D-1712371 Student GPA-45 3. DELETESTUDENT id This method will be followed by an integer id. To implement this method, you have to iterate over the linked list of students you created and delete the student (node). If the student is not found, the method will print "There is no student with the id "#######* in the system." Page Soft CCCS224 Data Structures Example Input: DELETESTUDENT 1212371 Example Output: The student record was deleted successfully 4. FINDLARGEST This method will print the information of the student with the largest GPA. Example Input FINDLARGEST Example Output: The student with the largest GPA is Student name-Nada Alolmadi Student ID-1612371 Student GPA-47 5. PRINTLIST This method will print all the student records. Example Tapet PRINTLIST Example Output The list of students in the system 1 - Student name-Rasa Salah Student ID 1000000 Stadt GPA 42 2-Stadent Reem Ahmad Student ID-1020000 Student GPA 3.2 3. Student Alpi Student ID-1112371 Student GPA 3.5 and son Perdaf" CCCS224 Data Structures 6. REVERSEPRINTLIST This method will print all the student records in this system in reverse order you should implement this method using recursion. Example Input: REVERSEPRINTLIST Example Output 11 - Student same-Shabad Magsabi Student ID-1812371 Student GPA-10 10- Student nameGumana Algamdi Student ID-1722371 Student GPA-34 9 - Student name-Raged Althili Student ID=1712371 Student GPA-5 Deliverables: You should submit a zip file with three files inside: 1. Student.cpp 2. StudentList.cpp 3. Project.cpp (this is your main program) NOTE: your name, ID, section number AND EMAIL should be included as comments in all files! Page of CCCS224 Data Structures UML Diagrams: For this program, you will create two Classes (UML diagram shown below) and a third class for the main: Student name: String Id: int -ope: double - noxt: Student Studentist - head: Student constructors and the getters and setters and all other methods you need constructors and the petters and setters Aoplication as needed main method and any other methods as you need