Which algorithm is used for finding the minimum spanning tree of a graph?A$)$ Dijkstra's AlgorithmB$)$ Kruskal's AlgorithmC$)$ Floyd$-$Warshall AlgorithmD$)$ Bellman$-$Ford Algorithm