Use Kruskal's algorithmto find a minimum spanning tree for thethis weightedgraph.

a$)(15$ pts$)$ List the edges that are addedtospanning tree in order. $\{Ex$:$1.\{a,d\}2,\{k,||\}3$dots$)$

b$)(5$ pts$)$ Calculatetotal weight.

a$)$ The edzes are added in the order.

$\{a,b\},\{a,e\},\{c,d\},\{d,h\},\{a,d\},\{a,m\},\{d,p\},\{e,f\},\{e,i\},\{g,h\},\{1,p\},\{m,n\},\{n,o\},\{1,j\},$ and $\{k,1\},$

b$)$ total weizht of $28.$