Data structure 17

Deque (10) Consider a double-ended queue data structure named, deque, which supports the following operations: PUSH(inserts item a to the front of the deque data structure. . POPO-removes the item at the front of the deque data structure. .INJECTxinserts item x to the back of the deque data structure EJECTO-removes the item at the back of the deque data structure. Answer the following questions. (a) (3) Could the deque emulate a queue data structure? Justify your answer (b) (3) Could the deque emulate a stack data structure? Justify your answer (c) 4) Explain how you would implement the deque data structure using two stacks. Justify your