+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Show how to use a stack S and a queue Q to generate all possible subsets of an n-element set T…

1. Show how to use a stack S and a queue Q to generate all possible subsets of an n-element set T…

1. Show how to use a stack S and a queue Q to generate all possible subsets of an n-element set T nonrecursively.2. Suppose you have a stack S containing n elements and a queue Q that is initially empty. Describe how you can use Q to scan S to see if it contains a certain element x, with the additional constraint that your algorithm must return the elements back to S in their original order. You may only use S, Q, and a constant number of other primitive variables.