Question $10$

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

edges:

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

following questions.

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

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

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

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