document.write( "Question 1161123: Is it C? I want to check my answer.\r
\n" ); document.write( "\n" ); document.write( "Which of the following is the cheapest route to visit each city using the \"Brute Force Method\" starting from A and ending at A. \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "A. ABCDA
\n" ); document.write( "
\n" ); document.write( "B. ADCBA\r
\n" ); document.write( "\n" ); document.write( "C. ABDCA\r
\n" ); document.write( "\n" ); document.write( "D. None of the Above\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The question is provided in the link here: https://i.imgur.com/r9Xe37R.png
\n" ); document.write( "

Algebra.Com's Answer #784591 by greenestamps(13206)\"\" \"About 
You can put this solution on YOUR website!


\n" ); document.write( "The answer is NOT C.

\n" ); document.write( "The brute force method determines the cheapest route by examining ALL POSSIBLE routes. ABCDA is not the cheapest route.

\n" ); document.write( "In a relatively simple graph like this, the cheapest route will be one that does NOT follow the most expensive edge.

\n" ); document.write( "In this graph, edge CD is the most expensive. Answer choices A, B, and C all use edge CD (or DC), so the answer is D none of the above.

\n" ); document.write( "This graph is small enough it is not very difficult to list all possible circuits and find the cost of each.

\n" ); document.write( "ABCDA
\n" ); document.write( "ABDCA
\n" ); document.write( "ACBDA
\n" ); document.write( "ACDBA
\n" ); document.write( "ADBCA
\n" ); document.write( "ADCBA

\n" ); document.write( "Note that this list of all 6 circuits is actually 3 different circuits, each listed twice, in opposite orders.

\n" ); document.write( "The cheapest route is either of the two that do not use edge CD: ACBDA or ADBCA -- which again are the same circuit in opposite directions.

\n" ); document.write( "
\n" ); document.write( "
\n" );