please answer in java

please answer in java

20 pts Consider a slight variation on the queue. In this version new items can be added to and removed from the end. This data structure is commonly called a doubly-ended queue, or deque. Implement one method of each type...one Wert" and one "remove". given in the Deque) class. You may assume the DequeException class tas been defined for you. Hint: remember to handle all of the special cases! public class Deque { private class Node { private Node(T data) { this.data - data; } private T data; private Node next; private Node prev; } public void insertAtHead(E data) {...} public void insertAtTaille data) {...} public E removeFromHead() throws DequeException {...} public E removeFromTail() throws DequeException {...} private Node head; private Node tail; } REMEMBER! ONLY IMPLEMENT (insertAtHead AND removeFromHead) OR (insertAtTail AND removeFromTail). implementing 1 insert and 1 remove methods for 2 methods total, NOT 4 METHODS: The "remove" methods sh- DequeException when the Deque is empty. BIU A- A - I E III IX X := * 12pt Paragraph