a) Draw the visual representation of the weighted undirected Graph G, specified by the vertex set V and the edge set S b) Use Kruskal's algorithm to derive the minimum spanning tree for the weighted undirected Graph G. C) Determine the least-cost path from node A to node D in the weighted undirected Graph G. V = {A, B,C, D, E} S = {{{A, E}, 2), ({A, C}, 7), ({C, E}, 4), ({C, D}, 4), ({E, D}, 5), ({A, B},5), ({B, D},6), ({E, B}, 3)}