Match $\text{List I}$ with $\text{List II}$
$\text{List I}$ |
$\text{List II}$ |
$\text{A}$. Dijkstra's Algorithm |
$\text{I}$. Calculates path matrix |
$\text{B}$. Prim's Algorithm |
$\text{II}$. Stores minimum cost edge |
$\text{C}$. Warshall's Algorithm |
$\text{III}$. Stores the total cost from a source node to the current node |
$\text{D}$. Kruskal's algorithm |
$\text{IV}$. Finds Minimum Spanning Tree |
Choose the correct answer from the options given below:
- $\text{A-I, B-II, C-III, D-IV}$
- $\text{A-III, B-II, C-I, D-IV}$
- $\text{A-II, B-I, C-IV, D-III}$
- $\text{A-III, B-IV, C-II, D-I}$
(Option $1 [39585]) 1$
(Option $2[39586]) 2$
(Option $3 [39587]) 3$
(Option $4 [39588]) 4$
Answer Given by Candidate: $2$