brute force algorithm

Kristin is planning to visit four cities A, B, C, and D. The table to the right shows the time (in hours) that it takes to travel by car between any two A B C D cities. Find an optimal tour for this TSP that starts and ends at A. A 13 14 15 B 13 * 17 15 C 14 11 * 12 D 15 15 12 Find an optimal tour using the brute-force algorithm. Choose the correct answer below. A. A, B, D, C, A or A, C, D, B, A B. A, B, C, D, A or A, D, C, B, A or A, B, D, C, A or A, C, D, B, A C. A, B, C, D, A or A, D, C, B, A D. A, C, B, D, A or A, D, B, C, A E. A, B, D, C, A or A, C, D, B, A or A, C, B, D, A or A, D, B, C, A OF. A, B, C, D, A or A, D, C, B, A or A, C, B, D, A or A, D, B, C, A G. All of the routes are of equal distance