Use the number "9" to create a weighted connected graph with the following characteristics: The assigned number of vertices are alphabetically labeled starting with A. Vertex A is not adjacent to vertex G. At least two vertices have a degree greater than 2. All weights are greater than 0. No weights are the same. 1. Identify the degree of each vertex in your graph. 2. Explain whether the graph has an Euler trail, using definitions, properties, or theorems. 3. Describe a path from vertex A to G. 4. Find the total weight of the path from part F3. Show all work