Using a mapping service to obtain distances, create a weighted graph with the following locations as vertices: your place of residence your place of employment or local large business favorite restaurant police station or local law enforcement office local hospital or medical center if 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. create the graph below labeling all parts. using the graph in part 1, provide either an euler path or an euler circuit. explain why one exists and the other does not. using the graph in part 1, find the optimal tour for your graph by applying the brute force algorithm. using the graph in part 1, apply the nearest neighbor algorithm with your place of residence the reference vertex. is this the optimal tour for your graph? why or why not. as