Python Programming -

Fix the code so asks user to input a set or frozenset and output gives the user the powerset

def list_powerset(lst): # the power set of the empty set has one element, the empty set result = [[]] for x in lst: # for every additional element in our set # the power set consists of the subsets that don't # contain this element (just take the previous power set) # plus the subsets that do contain the element (use list # comprehension to add [x] onto everything in the # previous power set) result.extend([subset + [x] for subset in result]) return result # the above function in one statement def list_powerset2(lst): return reduce(lambda result, x: result + [subset + [x] for subset in result], lst, [[]]) def powerset(s): return frozenset(map(frozenset, list_powerset(list(s)))) def main(): if __name__=="__main__": main() 

Python Coding Help Please provide properly structured code and screenshot of output. Thanks le) powerset: This function should accept a set or trozenset, and compute its power set: the set of all its subsets. While the input could be a set, the output must be a frozenset (or set) of trozensets; python does not permit mutable sets nested within a set because a mutation could change a set's hashcode and thus its position in the outer hashset containing it. Try writing this inductively as you did for assignment 0. What are the base case and the recursive case? (Hint: You may want to use mutable set's set pop() to separate an arbitrary set element from the rest of a set. Hint 2: Not knowing if the argument s is a set or frozenset, you can use set (s) or frozenset(s) to instantiate a new set or frozenset based on the argument in either case.) Python Coding Help Please provide properly structured code and screenshot of output. Thanks le) powerset: This function should accept a set or trozenset, and compute its power set: the set of all its subsets. While the input could be a set, the output must be a frozenset (or set) of trozensets; python does not permit mutable sets nested within a set because a mutation could change a set's hashcode and thus its position in the outer hashset containing it. Try writing this inductively as you did for assignment 0. What are the base case and the recursive case? (Hint: You may want to use mutable set's set pop() to separate an arbitrary set element from the rest of a set. Hint 2: Not knowing if the argument s is a set or frozenset, you can use set (s) or frozenset(s) to instantiate a new set or frozenset based on the argument in either case.)