A spanning tree for an undirected graph G is a connected subgraph that contains all the vertices in G and is a tree. A spanning tree of minimum weight is called a minimum spanning tree. Given a connected, weighted, undirected graph G as follows: 1 4 (a) Draw all the spanning trees for G. (b) What are the minimum spanning trees for G? (c) Apply Kruskal's algorithm to determine a minimum spanning tree. (d) Give the worst-case time complexity for a graph having n vertices and m edges