Use Kruskal$$s algorithm to find the minimum spanning tree of the

following weighted graph.

s

a

b

c

d

e

f

g

$8$

$4$

$7$

$3$

$5$

$2$

$4$

$3$

$5$

$5$

$8$

$4$

$7$

$2$

$3$

$2.$ Use Prim$$s algorithm to find the minimum spanning tree of the graph

in the previous question.

$3.$ Use Dijkstra$$s algorithm to find the shortest path from node s to node

g in the following weighted, undirected graph