Consider the following directed graph:
Which of the following is/are correct about the graph?

- AThe graph does not have a topological order.
- BA depth-first traversal starting at vertex classifies three directed edges as back edges.
- CThe graph does not have a strongly connected component.
- DFor each pair of vertices and , there is a directed path from to .

