Say that we want to maintain both a stack and a queue of the same elements. a new element that arrives implies a push to the stack and a enqueue to the queue. any pop operation should remove the element from the queue and from the stack as well (even though its not the highest propriety element). dequeue removes the head of the queue, but also removes this element from the stack (even though its not the last to being inserted). using two copies of every element and using additional pointers between element, show that we can implement both a stack and a queue so that every operation requires o(1) time.