Draw the following weighted graph: G = {1, 2, 3, 4, 5, 6, {1, 2, 6}, {1, 4, 5}, {1, 3, 1}, {2, 3, 5}, {3, 4, 5}, {2, 5, 3}, {4, 6, 2}, {3, 5, 6}, {3, 6, 4}, {5, 6, 6}} b) Use Prim's algorithm to draw the minimum spanning tree for G. c) Use Kruskal's algorithm to draw the minimum spanning tree for G