A deque is a data structure consisting of a list of items on which the following operations are possible:(a)push(x, d): Insert itemx on the front end of the dequed.(b)pop(d): Remove the front item from dequed and return it.(c)inject(x, d): Insert itemx on the rear end of dequed.(d)eject(d): Remove the rear item from dequed and return it. Choose a proper representation and write functions that take O(1) time to support each of the above operations.