Q2Multiple correct3 Marks10 May 2026Which of the following statements are correct?ADijkstra's algorithm can be used to find the minimum weight spanning tree in a graph.BBellman-Ford algorithm can be used to indicate whether a graph has negative weight cycles or not.CBellman-Ford algorithm provides a solution for the single source shortest path problem.DFloyd-Warshall algorithm is applicable for graphs that contain negative cycles.
