1)

Trace DFS algorithm below a) Start from node d. Assign to each node a pair of numbers. The first number should be the order when that node is first visited (or put on the stack), and the second number is order when that node is finished (or removed from the stack). In addition, mark the directed edges with T, B, F, or C (tree, back, forward or cross). Specify if topological ordering based on DFS is possible. If YES provide the topological order of nodes.

2)

Trace the algorithm to produce topological sorting based on source removal for the graph below. The trace should show the picture of the graph after each step (each deletion). List resulting order of vertices for this topological sorting algorithm.

Thank you so much!

O------- e b1011111-10I-g d a a f C