To be able to fuse two data structures (Stack and Queue) operations and complexities in one single one. Student should be able to identify the best implementation for this particular data structure and with its complexity analysis

How to remove second in queue from the deque. ? Sow code Java

- it should remove and return second entry of the deque and front entry remains same and third entry becomes second and

=it should return the second object null if it doesn't exist

How to remove second to last from deque ? Show code in Java

- it should remove and return the second entry of dequw while all other entries stay same and that the third entry to last entry becomes the second to last. It should return the second to last in the due and null if it doesn't exist