IN PYTHON ONLY! Given the function: def permutations_1 (permutation, new_value): Inserts value into a list of integers and produces al1 permutations of that list. " list-of-new-permutations = [] for i in range(len (permutation) 1): new permutationlist (permutation) new-permutation . insert ( i, new value) list_of_new permutations.append (new_permutation) print (list_of_new permutations) A) Write a function that takes a list of lists and a value as input and applies the function from question 1 to each list in the list of lists with the value and concatenates all of the resulting list of lists into one long list of lists. B) Write a function that starts with a working list of a single list containing 0 (that is, it starts with [[O]). By repeatedly applying the function from question 2 to the working list of lists and with numbers increasing to a size limit, this function will generate a list of all permutations of the specified size