The following is a simple weighted undirected graph, where vertices have letter labels $($a$,$ b$,$ c$,...).$ The edges with their corresponding weights are:

$($a$,$ b$,11),($a$,$ d$,9),($a$,$ f$,3),($a$,$ i$,5),($b$,$ d$,6),($b$,$ g$,4),($b$,$ h$,7),($b$,$ i$,9),($c$,$ e$,10),($c$,$ g$,1),($c$,$ h$,5),($d$,$ h$,2),($e$,$ f$,6),($e$,$ g$,7),($f$,$ h$,12),($f$,$ i$,8).$

Use Prim's algorithm to find a minimum spanning tree for the graph, starting from node a$.$ List the nodes in the order that you visit them while running Prim's algorithm, one node per blank: