Match List I with List II and choose the correct answer from the code given below.

Where V and E are the number of vertices and edges in the graph respectively.

1. A(a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
2. B(a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)
3. C(a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)
4. D(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)

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

Show answer & explanation

Correct answer: B. (a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)

Explanation

Dijkstra with an array is O(V²); Kruskal is O(E log E); Floyd–Warshall is O(V³); topological sort is O(V + E).