(40 points) Consider the following graph. g a. (20 points) Apply the DFS-based algorithm to solve the topological sorting problem, by showing the traversal stack, the popping-off order, and the final topologically sorted list. b. (20 points) Apply the source-removal algorithm to solve the topological sorting problem, by illustrating the source removal procedure