1. Need help w/ questions 1-9 I am not sure how to construct the graphs correctly.
   

\fDraw a graph of the cities. Use the abbreviations given in the chart. ll want the cities to be placed appropriately, look at a map on line if necessary]. Connect the cities using weighted edges. You mail,r use either the time or cost as the weight. Make sure the map is large enough for me to be able to read the weights. Show all edges. This needs to be a complete graph, not just a connected graph. Feel free to attach a separate sheet if 1llrou need more space. [25 points] 2. How many Hamilton circuits are possible for this graph? is points] 3. What is the shortest ying time between 2 of the cities? {3 points] 4. What is the cheapest ight between 2 of the cities (3 points] 5. What is the longest ying time between 2 of the cities? (3 points] 6. What is the most expensive ight between 2 of the cities? {3 points) I". Find the nearest neighbor circuit starting in NY based on ying time. List the circuit and give the total ying time. Make sure to give the time in hours and minutes. (20 points} 8. Find the nearest neighbor circuit starting in LA based on cost. List the circuit and give the total oost of the circuit. {20 points} 9. Suppose Florida decides to construct a high speed rail. The initial cities to be connected are Tallahassee. Jacksonville, Miami, Orlando. Tampa and Gainesville. The distances between the cities are given in the chart below. Find the minimal spanning tree for the high speed rail. Your answer should include the graph (drawn with the cities in the correct geographic locations and labeled} and the total distance the rail will cover. {20 points) Tallahassee Jacksonville Orlando Tampa Miami Gainesville Tallahassee E 153 miles 251 miles 275 miles 149 miles Jacksonville 1.53 miles E 141 miles 199 miles Tampa 215 miles 199 miles 84 miles 281 miles 133 miles \"W\" m