Use the Kruskal algorithm to find a minimum spanning tree for the graph G defined via V(G) = {a, b, c, d,e} E(G) = {ab, bc, cd, de, ae} VG(ab) = {a,b} va (bc) = {b,c} VG (cd) = {c,d} VG(de) = {d, e} vc(ae) = {a, e} and with weight function. f = {(ab, 1), (bc, 2), (cd, 2), (de, 1), (ae,4)}