Please develop a well-documented pseudocode that generates all possible subsets of a given set T (i.e. power set of T) containing n elements with the following requirement:  solution must be non-recursive, and must use a stack or/and a queue to solve the problem. For example: if T = {2, 4, 7, 9} then your algorithm would generate: {}, {2}, {4}, {7}, {9}, {2,4}, {2,7}, {2,9}, {4,7}, {4,9}, {7,9}, …etc. (Note: algorithm’s output needs not be in this order). a) What is the time complexity of your algorithm? Explain how you obtained that complexity. b) What is the space complexity of your algorithm? Explain how you obtained that complexity.

Please develop a well-documented pseudocode that generates all possible subsets of a given set T (i.e. power set of T) containing n elements with the following requirement:  solution must be non-recursive, and must use a stack or/and a queue to solve the problem. For example: if T = {2, 4, 7, 9} then your algorithm would generate: {}, {2}, {4}, {7}, {9}, {2,4}, {2,7}, {2,9}, {4,7}, {4,9}, {7,9}, …etc. (Note: algorithm’s output needs not be in this order). a) What is the time complexity of your algorithm? Explain how you obtained that complexity. b) What is the space complexity of your algorithm? Explain how you obtained that complexity.