stacks and queues experiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved start with the initial configuration of the queue workshop applet alternately remove and insert items (this wayyou can reuse the deleted key value for the new item without typing it notice how the group of four items crawls up to the top of the queue and then reappears at the bottom and keeps climbing using the priorityq workshop appletfigure out the positions of the front and rear arrows when the priority queue is full and when it is empty why can' priority queue wrap around like an ordinary queue think about how you remember the events in your life are there times when they seem to be stored in your brain in stackin queuein priority queueprogramming projects writing programs that solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied (as noted in the introductionqualified instructors may obtain completed solutions to the programming projects on the publisher' web site write method for the queue class in the queue java program (listing that displays the contents of the queue note that this does not mean simply displaying the contents of the underlying array you should show the queue contents from the first item inserted to the lastwithout indicating to the viewer whether the sequence is broken by wrapping around the end of the array be careful that one item and no items display properlyno matter where front and rear are create deque class based on the discussion of deques (double-ended queuesin this it should include insertleft()insertright()removeleft()removeright()isempty()and isfull(methods it will need to support wraparound at the end of the arrayas queues do write program that implements stack class that is based on the deque class in programming project this stack class should have the same methods and capabilities as the stackx class in the stack java program (listing the priority queue shown in listing features fast removal of the high-priority item but slow insertion of new items write program with revised priorityq class that has fast ( insertion time but slower removal of the highpriority item include method that displays the contents of the priority queueas suggested in programming project