1. In the figure below there is a weighted graph, dots represent vertices, links represent edges, and numbers represent edge weights. S 1 2 3 1 1 3 2 3 3 T 3 2 1 1 2 4 2 (a) Find the shortest path from vertex S to vertex T, i.e., the path of minimum weight between S and T. (b) Find the minimum subgraph (set of edges) that connects all vertices in the graph and has the smallest total weight (sum of edge weights).