Apply the DFS-based algorithm to solve the topological sorting problem for the following digraph:

(Show the order of the vertices popped off the stack as well as the topological sorting order of the vertices)

--------------------------------------------------------------------------------------------------------------------------------------------

Design a decrease-by-one algorithm for generating the power set of a set of n elements. (The power set of a set S is the set of all the subsets of S, including the empty set and S itself)Q2:

.