Determine the Minimum Spanning Tree in Graph A. Use Kruskal's Algorithm in which all edges must be labeled from lower to higher named vertices, e.g., from "c" to "d" but not from "d" to "c" Graph A Draw a hexagon with vertices a-b-d-z-e-c-a. Connect vertices b to c; b to z; d to e. Edge values are: a-b = 3; a-c = 5; b-c = 3; b-d = 5; b-z = 4; c-e = 5; d-e = 2; d-z = 7; e-z = 4.