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.