Python question involving stack, queue, and/or deque: Python give alternative to queue ADT (abstract data type)

Question 4i Give an alternative implementation for the Queue ADT. Implementation Requirements: 1. For the representation of Queue objects, your data members should be: Two Stacks - of type ArrayStack Additional (1) space for additional data members, if needed 2. Any sequence of n enqueue and dequeue operations (starting with an empty queue) should run in worst-case of (n) altogether