1. A deque (pronounced "deck") is similar to a queue, except that elements can be enqueued at either end and dequeued from either end. Define a Deque ADT and then provide an implementation for your definition.
2. Design and implement a ToDo List ADT in which each entry can be assigned a priority and the entries with the highest priority are performed first.