A Consider the following directed graph G = (V,E). B E F D G H I J 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. 2. Draw the meta-graph of G and give the set of vertices in each connected component. 3. What is the minimum number of edges you must add to G to make it consist of only one connected component?