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 w 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, 7, 9 } then your algorithmt would generate: { } , {2 4) , 17}, {9}, {2,4}, {2,7}, {29}, {4,7% {4,9}, {7,9}, etc.(Note: your algorithm's output need not be in this order). b) Calculate the time complexity of your algorithm using the big-Oh notation. Show all calculations