Question: Which of the following statements about Graph Traversal algorithms is correct?

A) Depth First Search (DFS) always finds the shortest path between two nodes in an unweighted graph.
B) Breadth First Search (BFS) is guaranteed to find the shortest path in an unweighted graph because it explores all neighbors at the present depth before moving on to nodes at the next depth level.
C) Dijkstra’s algorithm can find the shortest path in graphs that contain negative edge weights without any modifications.
D) In a directed acyclic graph (DAG), topological sorting can only be performed using DFS.