Assume that we have run Depth-First-Search (DFS) on a directed graph G(V, E) and obtainedthe following discovery and finishing times for each vertex in V
Assume that we do not know E. For each of the following pairs of vertices, indicate whetherthe respective edge is (Y), can be (M) or cannot be (N) in E. For those that are or can be in E,also indicate the designation of each edge (T, F, B, or C) according to this run of DFS on G
Attachment:- exercise3_solution.pdf