Q. to solve the all-pairs shortest paths problem which algorithm's is/are used
a) Floyd's algorithm
b) Dijkstra's single-source shortest paths
c) Prim's Algorithm
d) Kruskal's Algorithm

• (A) a) and c)
• (B) a) and b)
• (C) b) and c)
• (D) c) and d)