Q3. Answer the following questions: a) 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,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: your algorithm's output needs not be in this order). b) Calculate the time complexity of your algorithm using the big-Oh notation. Show all calculations