3. Given a directed weighted graph G = (V,E) with every edge e has weight w(e) > 1 . Assume G contains a node s that can reach all other nodes. (c) Given a directed weighted graph G (V, E) such that every edge is bi-directional, i.e., an edge (u, v) in G implies another edge (v,u) and they have same weights. Fix an arbitrary node v in G, and like what we have done in part(c), we can find a stable tree Tf for Gj Prove that is the minimum spanning tree of G, if ignoring the directions on G, (d) Use the way we compared directed paths before to extend it to compare between two span- ning tree which one is "better." Argue that the MST defined as the tree that has the minimum sum of weights of its edges, is the same tree that is smaller than all other trees if we just determine which is smaller among 2 trees by comparison rather than addition. 3. Given a directed weighted graph G = (V,E) with every edge e has weight w(e) > 1 . Assume G contains a node s that can reach all other nodes. (c) Given a directed weighted graph G (V, E) such that every edge is bi-directional, i.e., an edge (u, v) in G implies another edge (v,u) and they have same weights. Fix an arbitrary node v in G, and like what we have done in part(c), we can find a stable tree Tf for Gj Prove that is the minimum spanning tree of G, if ignoring the directions on G, (d) Use the way we compared directed paths before to extend it to compare between two span- ning tree which one is "better." Argue that the MST defined as the tree that has the minimum sum of weights of its edges, is the same tree that is smaller than all other trees if we just determine which is smaller among 2 trees by comparison rather than addition