MINIMAL SPANNING TREES

$($a$)$ Describe an algorithm to determine the minimal spanning tree of a graph.

$($b$)$ Find the minimal spanning tree of the above graph and give all edges, like $($a$,$ b$),$ belonging

to that tree. Numbers on edges are their length. $($Drawing is not according to scale.