Python question involving stack, queue, and/or deque

Question 5: Implement the following function: def permutations (lst) The function is given a list 1st of integers, and returns a list containing all the different permutations of the elements in 1st. Each such permutation should be represented as a list. For example, if lst= [1, 2, 3j,the call permutations (1st) could return , 2, 3], [2, 1, 3, [1, 3, 2], [3, 2, 1, [3, 1, 2], [2, 3, 111 Implementation Requirements 1. Your implementation should be non-recursive. 2. Your implementation is allowed to use a Stack, a Queue, and (1) additional space Hint: Use the stack to store the elements yet to be used to generate the permutations, and use the queue to store the (partial)collection of permutations generated so far