Data structure Question; Create an unread E-mail structure/operation.

5. Propose a data structure to use for the following situation. Justify your choices. You do not need to give complete code, but it should be clear how your solution is intended to work. You can use all data structures and operations on these data structure that have been described in lectures as "black-box" without giving an implementation. You want to write a simple "unread email manager". New emails arrive frequently, for each email you also have a deadline for handling the email. On arrival of an email you want to add the new email to your struc- ture. You always want handle the email with closest deadline. Because of the huge amount of emails, you can miss deadlines on several of the emails at a time. In this case you want to be able to delete all such emails at once without reading them. Your "unread email manager" should be able to: Add new unread email to your structure. Find the email with the closest deadline, output it, and delete it from the structure. Delete all the emails for which you missed the deadline. What is the time required for the three basic operations (add a new email, find the next email to read, and delete all emails pass the deadline)? [16 marks)