Consider the weighted graph G:

a b c

d e f

g h i

Weights for G:

Edge Weight

ab $2$

ad $8$

ae $10$

af $5$

bc $15$

bd $9$

bf $4$

Edge Weight

cd $14$

ce $13$

cf $16$

de $11$

dg $6$

dh $17$

di $2$

ef $18$

Edge Weight

eg $12$

ei $12$

f g $1$

f h $15$

f i $7$

gh $19$

hi $20$

Use Kruskal$$s algorithm to find a minimal connector and state its weight