4. Using Python, generate all sublists of a list. Note there will be 2**len(x) subsets of the list x. For example, the list [0,1,2] has seven sublists: [[0],[1],[2],[0,1],[1,2],[0,2],[0,1,2]]. Note that you don't have to mind the ordering of each sublist. Also, we don't care about the empty list ([]). The input to the function should be a list of unique items to be processed.

4.Generate all sublists of a list. Note there will be 2**len(x) subsets of the list x. For example, the list [9,1,2] has seven sublists: [Le], [1],[2], [e,1], [1,2], [e,2], [e,1,2]]. Note that you don't have to mind the ordering of each sublist. Also, we don't care about the empty list ([]). The input to the function should be a list of unique items to be processed . Hint: use recursion . Hint: You probably want to use list instead of set Here is the output of all_sublists(range(4)): 12], L3], [2, 31