Python 3

def powerset (A) " " "Build the powerset of A Given a set A, the powerset of A is the set of all subsets of A. Hint: recursion, anyone? no, really, you need to use recursion Hint: there are two base cases to the recursion: see lecture for the way to think about powerset recursively first base case: size of A is 0 second base case: size of A is 1 Hint: when you are changing a list, cloning makes it safer Hint: you may not want to test this function on a set of size 40, unless you are very patient, are not concerned about the due date, and have a lot of spare cash for memory upgrades (if that is not clear, watch the Eames video again) >>powerSet (C1,2]) C], 011, C2], C1,21] Params: A (list): finite set of integers, represented internally as a list Returns: (list) powerset of A, represented internally as a list