We need to install a new cable network between the six nodes (a, b, c, d, e, f, g, h and i) shown in

Graph G below for the least total cost. The weighted graph G shows the new cable's installation 13+2+2-7 Marics)

cost along each path. a) Find the minimum spanning tree for this graph G using Kruskal's Algorithm. Calculate the Total cost.

b) Given a weighted, undirected graph G: Which condition/s must hold such that there is only one minimum spanning tree for G? Will the above Graph G have a unique minimum spanning tree? c)