Solve the problem.Elijah Allman is a Spanish teacher in a rural school district. Elijah's job requires him to travel to three different high schools during the day: Northwest High; Smith High; and Southwest High. The distances among these schools and Elijah's home are summarized below:
a) Represent this traveling salesman problem with a complete graph showing the distances on the appropriate edges.b) Use the Brute Force algorithm to find the shortest route for Elijah to travel to each school and return home.c) What is the minimum distance he can travel?
What will be an ideal response?
a)
b) Home ? Southwest ? Northwest ? Smith ? Home (or Home ? Smith ? Northwest ? Southwest ? Home)
c) 59 miles
Mathematics
You might also like to view...
Find the magnitude and direction angle (to the nearest tenth) for each vector. Give the measure of the direction angle as an angle in [0,360°].
A. 14; 150° B. 28; 150° C. 28; 30° D. 14; 330°
Mathematics
Solve the problem.Find k if x = 
is a solution of the equation kx2 + x - 9 = 0.
A. k = 
B. k = 
C. k = 
D. k = 
Mathematics
Graph the function. State whether it is increasing, decreasing, or constant..F(x) = 2
A. constant
B. constant
C. constant
D. decreasing
Mathematics
Use synthetic division to divide.
A. 
B. 
C. 
D. 
E. 
Mathematics