Match List I with List II

List I	List II
(A) Dijkstra's Algorithm	(I) Finds the shortest path between all pairs of vertices in a graph with positive or negative edge weights.
(B) Floyd-Warshall Algorithm	(II) Finds the shortest path in a weighted graph with non-negative edge weights.
(C) Bellman-Ford Algorithm	(III) Finds single-source shortest paths with possible negative weights.
(D) Prim's Algorithm	(IV) Finds the Minimum Spanning Tree (MST).

1. A(A)-(I), (B)-(II), (C)-(III), (D)-(IV)
2. B(A)-(II), (B)-(I), (C)-(III), (D)-(IV)
3. C(A)-(I), (B)-(II), (C)-(IV), (D)-(III)
4. D(A)-(III), (B)-(II), (C)-(IV), (D)-(I)

Pick an option to check yourself, or open the answer below.