Match the following and select the correct option.

$1$

BFS algorithm'

$2$

b

C

$3$

$4$

d

Kruskal's algorithm

DFS algorithm

Bellman$-$Ford algorithm

a

spanning tree

Shortest paths

Strongly Connected Components

Greedy approach