Write a program that implements a stack class that is based on the Deque class in Programming Project 4.2. This stack class should have the same methods and capabilities as the StackX class in the stack.java program (Listing 4.1).
Project 4.2
Create a Deque class based on the discussion of deques (double-ended queues) in this chapter. It should include insertLeft(), insertRight(), removeLeft(), removeRight(), isEmpty(), and isFull() methods. It will need to support wraparound at the end of the array, as queues do.