Could you help me with these two methods for deque linked chain? I appreciate it!

/** * Removes and returns the second entry of this deque The front entry stays * the same and the third entry becomes the second. * * @return the second object of the deque. Null, if it doesn't exist. @throws EmptyQueueException if the deque is empty before the operation. */ * public I removeSecond() { // YOUR CODE HERE } // end removeSecond /** Removes and returns the second to last entry of this deque. All other * entries stay the same and the third to last entry becomes the second to last. > * @return The object second to last in the deque and null if it doesn't exist. @throws EmptyQueueException if the deque is empty before the operation. */ public I removeSecondToLast() { // YOUR CODE HERE } // end removeSecondToLast /** * Removes and returns the second entry of this deque The front entry stays * the same and the third entry becomes the second. * * @return the second object of the deque. Null, if it doesn't exist. @throws EmptyQueueException if the deque is empty before the operation. */ * public I removeSecond() { // YOUR CODE HERE } // end removeSecond /** Removes and returns the second to last entry of this deque. All other * entries stay the same and the third to last entry becomes the second to last. > * @return The object second to last in the deque and null if it doesn't exist. @throws EmptyQueueException if the deque is empty before the operation. */ public I removeSecondToLast() { // YOUR CODE HERE } // end removeSecondToLast