Section 1: Undirected Graphs 1. Let G (V,E) be an udirected graph, where V-{a,b,c,d,e,fl and a. Determine all articulation points and bridges b. Show the distance from a to each vertex Section 2: Network 2. Calculate TV,E for Dijkstra's Algorithm 3. Let G V,E,c where Ea,b,2, a,c,3, c,b, 1), b,d, 1, c,e,3),(d,e,1) Draw the graph and construct the distance traversal tree rooted at a