6. (20 points) Solve each of the design problems below using the data structures we have learned so far: List, Stack, and Queue. For each, specify the data structure(s) to use and how you would use them to perform all the necessary operations. (a) You read a lot of library books. To avoid late fees, you have resolved to always read books in the order of the due date (3 weeks after you checked them out). Your bookshelf is cluttered so you can't store them in this order, however. Instead, you want to create a program to store the names and due dates of books that you've checked out. When you get bavk from the library, you will enter the books into your system. Then, when you finish a book, you will query the system and it will give you the name of the next book to read. How would you implement this system? (b) You are working at an animal shelter and would like to have software that allows shelter staff to keep track of their animals. When an animal arrives at the shelter they are added to the program with appropriate information (name, type of animal, sex, age, and picture). When that animal is adopted, they are removed from the system. Between these steps, the system allows potential pet adopters to print the names and basic information of animals currently at the shelter. It also allows them to select some animals of particular interest and look at their picture. How would you support these operations