Match the following and select the correct option. 1 BFS algorithm spanning tree a Kruskal's algorithm...

Transcribed Image Text:

Match the following and select the correct option. 1 BFS algorithm spanning tree a Kruskal's algorithm Shortest paths Strongly Connected Components DFS algorithm 4 Bellman-Ford d Greedy approach algorithm а) 1-с,2-а,3-d,4-b b) 1-d,2-b,3-a,4-c с) 1-b,2-а,3-с,4-d d) 1-a,2-d,3-c,4-b 3. Match the following and select the correct option. 1 BFS algorithm spanning tree a Kruskal's algorithm Shortest paths Strongly Connected Components DFS algorithm 4 Bellman-Ford d Greedy approach algorithm а) 1-с,2-а,3-d,4-b b) 1-d,2-b,3-a,4-c с) 1-b,2-а,3-с,4-d d) 1-a,2-d,3-c,4-b 3.