Graph theory amusement park project Part 1 Step 1-Draw a graph of an amusement park with 15 vertices, a Part 2 Euler-This will use one of your graphs 1-Label the degree of the vertices 2-Find an Euler circuit, you will have to eulerize. Indicate the repeated edges using multiple edges of a different color. loop, a multiple edge and a complete graph with 4 vertices. Number of vertices Degree 4 Part 3 Hamilton-Each part should be on a different graph or table The vertices must be: The entrance A Bathroom Three places to eat (with names) A store (named) Nine rides (named) 1- Draw a subgraph of your complete graph with 4 vertices. Use brute force to find all Hamilton circuits. 2-Use cheapest link and your table to find a circuit that includes all rides. If your graph does not have a Hamilton circuit you will need to add edges. Write the new edges on you chart in a different color. 3-Use your table or graph and nearest neighbor to find a circuit that includes all rides. Step 2-Determine the distance of each edge and put this information in a table and on your graph. Part 4 Minimum spanning tree-This will use one of you graphs 1-Use Kuskal's algorithm to find the minimum spanning tree for your park. Step 3-Make copies of your graph and table Graph theory amusement park project Part 1 Step 1-Draw a graph of an amusement park with 15 vertices, a Part 2 Euler-This will use one of your graphs 1-Label the degree of the vertices 2-Find an Euler circuit, you will have to eulerize. Indicate the repeated edges using multiple edges of a different color. loop, a multiple edge and a complete graph with 4 vertices. Number of vertices Degree 4 Part 3 Hamilton-Each part should be on a different graph or table The vertices must be: The entrance A Bathroom Three places to eat (with names) A store (named) Nine rides (named) 1- Draw a subgraph of your complete graph with 4 vertices. Use brute force to find all Hamilton circuits. 2-Use cheapest link and your table to find a circuit that includes all rides. If your graph does not have a Hamilton circuit you will need to add edges. Write the new edges on you chart in a different color. 3-Use your table or graph and nearest neighbor to find a circuit that includes all rides. Step 2-Determine the distance of each edge and put this information in a table and on your graph. Part 4 Minimum spanning tree-This will use one of you graphs 1-Use Kuskal's algorithm to find the minimum spanning tree for your park. Step 3-Make copies of your graph and table