java must include queues, deques and priority queue implementation Implement the ADT queue by using a circular linked chain, as shown in Figure 11-11. Recall that this chain has only an external...

Extracted text: java must include queues, deques and priority queue implementation Implement the ADT queue by using a circular linked chain, as shown in Figure 11-11. Recall that this chain has only an external reference to its last node. figure 11-11 below A circular linked chain with an external reference to its last node that (a) has more than one node; (b) has one node; (c) is empty FIGURE 11-11 (a) (b) (c) lastNode lastNode lastNode