Which of the following is the cheapest route to visit each city using the "Brute Force Method" starting from A and ending at A.

Group of answer choices

ABCDA, $960

ACDBA, $900

ACBDA, $960

None of the Above

  ACDBA, $900

Step-by-step explanation:

The cheapest route will be the one with the lowest cost. Of the routes listed, the cost $900 is the lowest, so route ACDBA is the cheapest.

The "Brute Force Method" requires you compute the costs of the possible routes and pick the lowest. The answer choices have done that for you.

The cost of ACDBA is AC +CD +DB +BA = 240 +230 +210 +220 = 900, as shown in the answer selections.

The three routes listed, and their reverses (which are the same cost), are the only possible routes starting and ending at A.

y < -3

step-by-step explanation:

-3y - 2 > 7

-3y -2 + 2 > 7+2

-3y > 9

-3y/-3 < 9/-3   (change the inequality sign when multiplying or dividing by a negative number)

y < -3