Q2. Answer the following questions: a) In class, we discussed a recursive algorithm for generating the power set of a set. In this assignment, you will 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 requirements: your solution must be non-recursive, and must use a stack and a queue to solve the problem. For example: if T = { 2, 4, 79) then your algorithm would generate: {}, {2}, {4} 7, 9, 24), 12,73, (2,9), 4.7), 4,9), 17.9), ...etc. (Note: your algorithm's output need not be in this order)