Question $9$

Consider the weighted undirected graph with vertices V$=\{$a$,$b$,$c$,$d$,$e$\}$ and the following weighted

edges:

Use Prim's algorithm from the textbook for finding the minimum spanning tree to answer the following

questions. Note, the initial spanning tree is the smallest weight edge with the connecting vertices.

Part a: Draw the graph $($please show graph!!$)$

Part b: Show the spanning tree after the first iteration $($two edges and the connecting vertices$).$

Part c: Show the spanning tree after the second iteration $($three edges and the connecting vertices$).$

Part d: What is the total weight of the edges of the minimum spanning tree produced by the

algorithm?