Which of the following is the cheapest route to visit each city using the "Brute Force Method" starting from A and ending at A. ABCDA
ADCBA
ABDCA
NONE OF THE ABOVE

answer   download the app called socratic on your phoner:

step-by-step explanation:

a reflection across the x-axis , followed by the by a reflection across the y-axis , and then a scale dilation of 0.5 .

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation: