Both in Python language :

Question 1:

Question 2:

Write a function, mirror_queue(a), which takes a Queue, q, as a parameter and modifies the queue so that the queue items appear in their original order followed by a copy of the queue items in reverse order. You must make use of a stack to help you to solve this problem. The implementations of both the Stack and Queue ADTs are provided to you. You can simply use: push0, pop), is empty0 as well as enqueue0 and dequeue0 as necessary in your function definition. However, you will need to use the following statement to create a Stack (in this question) s my_stack_module.Stack) Similarly, you will need to use the following statement to create a Queue (in this question) q-my queue_module.Queue) For example Test Result q1-my_queue_module.Queue q1.enqueue(1) q1.enqueue(2) q1.enqueue(3) mirror_queue(q1) print(q1) Queue: [1, 2, 3, 3, 2, 1] q1-my_queue_module.Queue Queue: mirror_queue(ql) print(q1) Answer: (penalty regime: 0 %) 1def mirror_queue(orig_queue): backup_s-my_stack_module.StackO 3 backup_q - my_queue_module.Queue