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.

Write a function named printfloatrepresentation(float number) that will print the floating point representation of a number using the format given below. (sign bit) exponent in binary (assumed bit).significandfor example if the number passed an argument is 71 yourprogram should print (0) 10000101 (1).00011100000000000000000similarl y if the number passed to the function as argument is -71 the program should print (1) 10000101 (1).00011100000000000000000

Joe needs to see the slide transitions and animations he has applied to his slides in a large view. which presentation view should he use? in which tab would joe find the animations option to make further changes, if any?

Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.