Consider the following directed graph.

$($a$)$ Provide a topological ordering of the graph by running DFS starting from vertex A and breaking ties alphabetically. Identify any tree edges, forward edges, back edges, and cross

edges. Label the pre$-$order and post$-$order numbers for each vertex.

$($b$)$ Is this the only valid topological ordering of the graph? Explain why or why not.