Show how to use a stack s and a queue q to generate all possible subsets of an n -element set t non-recursively.
a) Depth-first search
b) Breadth-first search
c) Dynamic programming
d) Greedy algorithm