Design an algorithm to find the minimum cost spanning tree for the graph of part$($c$)$ and

extend the tree to obtain a minimum cost spanning tree for the graph of part$($a$).$

$($b$)$

$($c$)$

a$)$ Design an algorithm to determine minimum cost of a tree.

b$)$ How many minimum spanning trees does it have?

c$)$ Suppose Kruskal's algorithm is run on this graph. In what order are the edges added

to the MST$?$

d$)$ Analyze your algorithm and give the results using order notation.