Consider the following directed graph. 1. Perform depth-first search with timing (DFS-with-timing) on the above graph; whenever there's a choice of vertices, pick the one that is alphabetically first: give

the pre and post number of each vertex.