Problem $1.$ For each of the following minimum spanning tree algorithms, mark the first

four edges that the algorithm would find when it is performed on the given graph.

$($a$)$ Borvka:

$($b$)$ Jurn$$k$,$ when it starts from the vertex in the center:

$($c$)$ Kruskal: