python please

IMPORTANT: For this exercise, you will be defining a function which USES both the Stack and the Queue ADTs. Your code can make use of any of the Queue ADT methods: Queue (), enqueue (), dequeue(), peek (), size() and is_empty() and any of the Stack ADT methods: Stack(), push(), pop(), peek(), size () and is_empty(). Write a function called mirror_queue (a_queue) which takes a Queue as a parameter. The function must modify the parameter Queue object so that the original queue items appear in their original order followed by a copy of the queue items in reverse order. HINT: It will be useful to make use of a Stack and another Queue to help you mirror the elements in the queue. For example: Test Result Queue: Front [1, 2, 3] Rear Queue: Front [1, 2, 3, 3, 2, 1] Rear 41 = Queue () q1. enqueue (1) 91. enqueue (2) 91. enqueue (3) print(91) mirror_queue (91) print(91) Queue: Front (1, 2, 3, 4, 5] Rear Queue: Front (1, 2, 3, 4, 5, 5, 4, 3, 2, 1] Rear q1 = Queue () q1. enqueue (1) q1. enqueue (2) 91. enqueue (3) q1. enqueue (4) 91. enqueue (5) print(91) mirror_queue (q1) print(91) Queue: Front [] Rear 91 = Queue () mirror_queue (91) print(91)