5. Find the length of the shortest path from vertex 1 to each of the other vertices in each of the following graphs. G 10 9 G 1 11 6. A tree is a graph containing no circuits. Let T be a tree with 12 vertices that has exactly 3 vertices of degree 3 and exactly one vertex of degree 2. a. Draw T b. Find the degree sequence of T. c. Find two different trees with this degree sequence (they need to be more than visually different but should have a different edge set)