Based on the Information in the Table, Use the Brute $\quad$

Based on the information in the table, use the brute force method to find the shortest routefrom Angleton to all the other cities and back to Angleton.

$\quad$$\quad$$\quad$$\quad$$\quad$$\quad$$\quad$$\text { Distance (in miles) between Cities }$
$\begin{array}{l|cccc} & \text { Angleton } & \text { Benton } & \text { Coppell } & \text { Doran } \\\hline \text { Angleton } & - & 60 & 66 & 61 \\\text { Benton } & 60 & - & 48 & 74 \\\text { Coppell } & 66 & 48 & - & 55 \\\text { Doran } & 61 & 74 & 55 & -\end{array}$

A) 255 miles
B) 249 miles
C) 215 miles
D) 224 miles