-handle the stack structure when applying push and pop operations to add or fetch and delete the nodes -handle the queue structure when applying enque and deque operations to add or fetch and delete the nodes.

Requirement Statement: Write the application to allow the librarians to use Stack or Queue structure to work with books. Suppose the library only keep 2 categories of books: some books are only read at the library (Book) and some books can be checked out to bring home (BorrowedBook) Each information of book (Book) has the following information: bookID (string), ISBN (string), title (string), writer (string), publisher (string) For books that can be checked out (BorrowedBook) should have more information: Checkout date (string) and due date (string) For each structure, the librarians can 1. Add a book 2. Remove a book 3. Display the book at top (or at front of Queue) 4. Show all books in the structure TASK DISPLAY THE BOOK AT TOP (or AT FRONT FOR THE QUEUE) -display the book at top (or front) or display the message box: “The Stack is empty” or “The queue is empty” TASK SHOW ALL BOOKS -display all the books or borrowed book on the stack (or queue) INSTRUCTION HOW TO DO THE LAB PART1 ANALYZE : -You should read the requirement again to see what the requirement gives you and what it asks you to do then write them on the paper. -The Book and BorrowedBook should have Inheritance relationship -Also, you need to apply polymorphism in the main to deal with Book object and BorrowedBook