Find the minimum spanning tree for the graph.
Where a = 60, b = 30, c = 2, d = 23, e = 55, f = 19, g = 40, h = 40, n = 95, k= 10, l= 30
Find the sum of the numbers associated with the edges of the minimum spanning tree.
