I need help with a java assignment, on creating a dequeue with a doubly linked list, i have linked starter code and my instructions

Background A queue is a collection that supports adding at the rear and removing from the front (i.e. engueue0, and degueue0). Here we define a related data structure called a degue for "double- ended queue." In a deque we can add, remove, or look at elements at either end (front and back). Its methods are: public interface Deque T public void addToFront element); public TremoveFront throws NoSuchElementException; public Tfirsto throws NoSuchElementException; public void addToRear element) public TremoveRear throws NoSuchElementException; public T last throws NoSuchElementException; public boolean isEmpty0; Like queues, degues are typically implemented with a linked list. Notice that in order to efficiently operate on both the front and the back of the queue, we need to keep references to both the head and the tail of our linked list. However, we need to be able to do more than simply add to the front and the back; we must also be able to remove. Note that for the back we need to be able to get the second to last node in order to disconnect the last node from the list. In order to do this, we'll be using doubly linked lists, so that the list can be explored in either direction Doubly linked lists are pretty similar to singly linked lists. However, they have a link to both the next node and the previous node. So when adding and removing from the list, you must make sure to update both of the links