Which of the following is one of the cheapest routes to pass through each vertex once starting and ending with Vertex "A" and us
ing the Nearest Neighbor Algorithm.
Group of answer choices
ABCDA, $960
ACDBA, $900
ACBDA, $960
None of the Above
Group of answer choices
ABCDA, $960
ACDBA, $900
ACBDA, $960
None of the Above
2 answers:
You might be interested in
Step-by-step explanation:
Divide two on both sides to get rid of it and the make the equation in the form y = mx + c
y = 3/2x + 5
since both lines are parallel they must have the same gradient which is 3/2
y = 3/2x + c
All you have to do now is to replace x and y with (2, -5) to find c
x = 2
y = -5
-5 = 3/2 × 2 + c
-5 = 3 + c
c = -5-3
c = -8