Refactor (rewrite) our queue data structure so that, instead of using a doubly-linked list, it instead uses two stacks. The time complexity of all operations in your list should match those in Table 4.7 (although some of the time bounds for your structure may be amortized). Which variant do you prefer, and why?

Queue Operation Pseudocode Time Complexity Create an empty queue queue = Queue() O(1) Get the length of a queue len(queue) O(1) Get an iterator for the elements in frontto-back order iter(queue) O(1) Get the element at the front of a nonempty queue x = queue.front() O(1) Add element x to the back queue.enqueue(x) O(1) Remove and return the element at the front x = stack.dequeue() O(1) Table 4.7: Queue Operations

Please if you can help me and give me the correct answer!

Best