Consider the following graph. Each node denotes a job and x-> y means job y is dependent on job x. Now, apply DFS considering 2 as the source node and determine a feasible job schedule. Consider the following requirements: I. If there are multiple options at any step, pick the node with smaller index. II. III. If you stuck at any point but there is still unvisited node in the graph, restart DFS from the node with smallest index. Show the start and finish time of each node, and show Print the job schedule. 5 2