Perform DFS on the following graph starting in vertex B. Whenever there is a choice of unvisited neighbors, choose the one that is alphabetically LAST. Compute pre and post values for the vertices of this graph. The pre and post timestamps for the selected vertices are: vertex B: pre of B is post of B is vertex C: pre of C is post of C is vertex G; pre of G is post of G is vertex A: pre of A is post of A is