1 Implement the Priority Queue ADT using each of the following: (a) sorted Python list (b) sorted linked list (c) unsorted linked list 2 A deque (pronounced \deck") is similar to a queue, except that...

1 Implement the Priority Queue ADT using each of the following:

(a) sorted Python list (b) sorted linked list (c) unsorted linked list

2 A deque (pronounced \deck") is similar to a queue, except that elements can be enqueued at either end and dequeued from either end. De_ne a Deque ADT and then provide an implementation for your de_nition.

3 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 _rst.

4 Printers can be connected to the network and made available to many users. To manage multiple print jobs and to provide fair access, networked printers use print queues. Design, implement, and test a computer program to simulate a print queue that evaluates the average wait time.