Question $5$ : Consider the following graph. Here, an $$ denotes job dependency, i$.$e$.,1->2$

means $1$ is a prerequisite of $2.$ Then, apply DFS to find a feasible job schedule. You need to

show the start and finish time for each node.

Special Rule: If multiple options $($either for traversal or

restarting DFS$)$ exist at any step, pick the job with a

smaller index.

For example, we can start DFS from any node. However,

according to the special rule, we must start DFS from

Node$-1.$