Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as a doubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’, ‘CGPA and ‘Age’ of the student....

Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as a
doubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’,
‘CGPA and ‘Age’ of the student. Following operations can be performed on the Student
Book.
• Constructor to create and Destructor to destroy the Student Book
• Add a Student if it is not already present in the Book.
• Delete a Student from the Book.
• Search a Student in the Student Book using Name or Reg. Number. If found
display its details. If not found, display ‘Student not found’.
• Display the Student details in forward and reverse order
• In main (), define an object of type StudentBook. Get details of 10 student from
the user and add to the StudentBook. Ask the user, if the user wants to display,
search or delete a student and perform the required actions, accordingly.