PYTHON:

Generate gensets:

Given an integer list n (no duplicates), return all possible subsets of n (any order) (as lists, not sets). Your output must not contain duplicate subsets. Feel free to write a recursive helper method. Also explain what is its Time / Space Complexity.

Example:

nums = [1,2,3]

[

[1,2,3],

[1,2],

[2,3],

[1,3],

[1],

[2],

[3],

[]

]

def gensets(n): pass