Give a counterexample to the conjecture that if a directed graph G has a path from u to v, then any DFS(depth-first search) must result in v.d u.f

That is, draw a graph, show u and v in the graph, and show a particular DFS by indicating discovery and finish times for each vertex.

The times should be such that v.d > u.f

** Please explain in detail