3.3. Run the DFS-based topological ordering algorithm on the following graph. Whenever you have a choice of vertices to explore, always pick the one that is alphabetically first (a) Indicate the pre and post numbers of the nodes. (b) What are the sources and sinks of the graph? (c) What topological ordering is found by the algorithm? Show transcribed image text 3.3. Run the DFS-based topological ordering algorithm on the following graph. Whenever you have a choice
OR
OR