Algorithms

Do not use any library or any code from web Write a program as library information system. The system is used students and staff. Students use the system for searching a book. Staff uses the system when a new book will be inserted to the system. Use Red-Black tree as your data structure and implement search and insert methods for this data structure. Books will be represented by a Book class. Each book has a title, author, ISBN number, year and a shelf id representing the place of the book in the library. Students must be able to search the book by ISBN or using title, author and year combination. Sample Run: Enter your choice (i for insert, s for search by ISBN, t for search by title, author, year combination, e exit): i Enter title: Introduction to algorithms Enter year: 2010 Enter author: Cormen Enter ISBN: 12345678 Enter shelf id: 123 Book inserted to red-black tree Enter your choice (i for insert, s for search by ISBN, t for search by title, author, year combination, e exit):s Enter ISBN: 12345678 Book is found on shelf 123 Enter your choice (i for insert, s for search by ISBN, t for search by title, author, year combination, e exit): t Enter title: Introduction to algorithms Enter year: 2010 Enter author: Cormen Book is found on shelf 123 . . . Enter your choice (i for insert, s for search by ISBN, t for search by title, author, year combination, e exit): e Bye.