Lets put numberings to the nodes as follows:
The back edges are those edges from $v$ to $u$ in set $(u,v)$ where $u$ came first (i.e. already explored) in the DFS tree/forest.
- $3$ to $2$
- $12$ to $11$
- $9$ to $S$
The DFS tree:
The graph has two cycles one at bottom left and one at bottom right. And every cycle forms SCC (Strongly connected component, since from every vertex $u,$ there is a path to $v, \bf{u \to v})$. C is false
The entire graph doesn’t have SCC. So, definitely D is false.
Due to the presence of cycles Topological Sort is not possible.
Hence, the answer is A and B.
D would have been correct if it was For some pair of vertices u and v there is a directed path from u to v.