Learning Goal: I’M Working On A Discrete Math Question And Need An Explanation A

Learning Goal: I’m working on a discrete math question and need an explanation aLearning Goal: I’m working on a discrete math question and need an explanation and answer to help me learn.ScenarioYou have just been hired on to be a technician for Bolts, a satellite company. You need to find the optimal route between several places within your city to decrease the time it takes to travel.InstructionsUsing a mapping service to obtain distances, create a weighted graph with the following locations as vertices:Your place of residenceYour place of employment or local large businessCity Hall or local seat of governmentPolice Station or local law enforcement officeLocal Hospital or medical centerIf there are more than one of any of these locations, choose only one of them from each bullet point to be on your graph. The edges on the graph will be labeled with the distance between each location.Once you have created the graph, answer the following questions:Is there an Euler path in your graph? If so, provide an Euler path. If not, make sure to explain why not.Is there an Euler circuit in your graph? If so, provide an Euler path. If not, make sure to explain why not.Find the weight of the following Hamilton path: your house, your place of employment, city hall, police station, and the local hospital. Is there a way to make this a Hamilton circuit? Explain.Using the Brute Force Algorithm, find the optimal tour for your graph. How do you know it’s the optimal tour? Explain.Use the Nearest Neighbor Algorithm with your house as the reference vertex. Is this the optimal tour for our graph? Why or why not.Use the Nearest Neighbor Algorithm with your place of employment as the reference vertex. Is this the optimal tour for our graph? Why or why not.Unformatted previewLearning Goal: I’m working on a discrete math question and need an explanation aLearning Goal: I’m working on a discrete math question and need an explanation and answer to help me learn.ScenarioYou have just been hired on to be a technician for Bolts, a satellite company. You need to find the optimal route between several places within your city to decrease the time it takes to travel.InstructionsUsing a mapping service to obtain distances, create a weighted graph with the following locations as vertices:Your place of residenceYour place of employment or local large businessCity Hall or local seat of governmentPolice Station or local law enforcement officeLocal Hospital or medical centerIf there are more than one of any of these locations, choose only one of them from each bullet point to be on your graph. The edges on the graph will be labeled with the distance between each location.Once you have created the graph, answer the following questions:Is there an Euler path in your graph? If so, provide an Euler path. If not, make sure to explain why not.Is there an Euler circuit in your graph? If so, provide an Euler path. If not, make sure to explain why not.Find the weight of the following Hamilton path: your house, your place of employment, city hall, police station, and the local hospital. Is there a way to make this a Hamilton circuit? Explain.Using the Brute Force Algorithm, find the optimal tour for your graph. How do you know it’s the optimal tour? Explain.Use the Nearest Neighbor Algorithm with your house as the reference vertex. Is this the optimal tour for our graph? Why or why not.Use the Nearest Neighbor Algorithm with your place of employment as the reference vertex. Is this the optimal tour for our graph? Why or why not. Why Choose Us 100% non-plagiarized Papers 24/7 /365 Service Available Affordable Prices Any Paper, Urgency, and Subject Will complete your papers in 6 hours On-time Delivery Money-back and Privacy guarantees Unlimited Amendments upon request Satisfaction guarantee How it Works Click on the “Place Your Order” tab at the top menu or “Order Now” icon at the bottom and a new page will appear with an order form to be filled. Fill in your paper’s requirements in the “PAPER DETAILS” section. Fill in your paper’s academic level, deadline, and the required number of pages from the drop-down menus. Click “CREATE ACCOUNT & SIGN IN” to enter your registration details and get an account with us for record-keeping and then, click on “PROCEED TO CHECKOUT” at the bottom of the page. From there, the payment sections will show, follow the guided payment process and your order will be available for our writing team to work on it.