I need someone to make a dequeue project using java.

The code you write for the methods of the queue class do not have to be long or complex. The methods should not move the values from one stack to the other any more than is absolutely necessary. You can use an example on paper to see and compare the values of the queue in the stacks in relation to how those same values appear in the abstract view of the queue. Download the files [login to view URL] and [login to view URL] for the framework for the QueueUsingStacks class. You’re only using this class to help in coding the DequeUsingStacks class as described on the next page. Remember, the size, isEmpty, and first methods of the queue are the exact same methods in the deque. The enqueue method of the queue is the addLast method of the deque. The dequeue method of the queue is the removeFirst method of the deque. You will write the implementation for the DequeUsingStacks class. Download the files [login to view URL] and [login to view URL] for the framework for the DequeUsingStacks class. You will write the code for all the methods of the DequeUsingStacks class except for the constructor. If needed, you can write additional methods to help in your implementation of any method of the DequeUsingStacks class but they must be defined as private. You cannot add any additional data members to the DequeUsingStacks class. You cannot add any nested classes to the DequeUsingStacks class.