1. Double-Ended Queue (JAVA)

A deque (pronounced deck) is a list-based collection that allows additions and removals to take place at both ends. A deque supports the operations addFront(x), removeFront(x), addRear(x), removeRear( ), size( ), and empty( ).

Write a class that implements a deque that stores strings using a doubly linked list that you code yourself. Demonstrate your class with a graphical user interface that allows users to manipulate the deque by typing appropriate commands in a JTextField component, and see the current state of the deque displayed in a JTextArea component. Consult the documentation for the JTextArea class for methods you can use to display each item in the deque on its own line.

Programming Challenges 1. Double-Ended Queue A deque (pronounced "deck") is a list-based collection that allows additions and removals ake place at both ends. A deque supports the operations addFront(x), removeFront ), Rear(x), remove Rear(), sizel ), and empty(). Write a class that implements a deque that stores strings using a doubly linked list that you code yourself. Demonstrate your class with add