Hello..Please solve these both questions in step-by-step manner..I will surely give you an upvote..But for that step-by-step solution is required..So please provide me solution ASAP and in step-by-step manner for these both questions..Thank you so much :))

Problem 1. In Fig. 1 there is a weighted graph, circles represent vertices, links represent edges, and numbers represent edge weights. 3 S F 2 4 3 2 N N 3 A D D T 3 3 1 1 1 1 N B E H H 3 3 3 3 2 N Figure 1: The graph. 1. Find a shortest path from vertex S to vertex T, i.e., a path of minimum weight between S and T. 2. Find a minimum subgraph (set of edges) that connects all vertices in the graph and has the smallest total weight (sum of edge weights). Justify your answers