A deque is a data structure consisting of a list of items, on which the following operations are possible: push(x): insert item x on the front end of the queue.
pop(): remove the front item from the deque and return it.
inject(x): insert item x on the rear end of the queue.
eject(): remove the rear item from the deque and return it.
getFront(): returns the element at the front of the deque.
getRear(): returns the element at the rear of the deque.

Write routines to support the deque that take O(1) time per operation. Use an array-based implementation. Write a tester class and name it Main.