2.For a slightly simpler problem, let us choose a subset of just 12 Extended Campus sites (ChandlerGilbert, Flagstaff, Ganado, Glendale, Kingman, Lake Havasu City, Phoenix, Prescott, Show Low, Tuba City, Tucson and Yuma). The distance between each pair of cities is given in the chart below:

Ch Fl Ga Gl Ki LHC Ph Pr SL TC Tu Yu

Ch 0 169 266 34 220 217 24 124 166 246 99 184

Fl 169 0 156 141 147 206 144 95 139 78 260 320

Ga 266 156 0 295 303 361 271 249 132 127 323 474

Gl 34 141 295 0 175 192 10 96 187 218 127 184

Ki 220 147 303 175 0 60 197 149 286 227 312 215

LHC 217 206 361 192 60 0 193 207 344 285 309 155

Ph 24 144 271 10 197 193 0 99 180 222 116 184

Pr 124 95 249 96 149 207 99 0 186 173 216 216

SL 166 139 132 187 286 344 180 186 0 202 190 352

TC 246 78 127 218 227 285 222 173 202 0 338 398

Tu 99 260 323 127 312 309 116 216 190 338 0 240

Yu 184 320 474 184 215 155 184 216 352 398 240 0

Find a Hamilton Circuit for this problem using the following methods, and give the length of the Hamilton circuit found.

a) Nearest Neighbor from Phoenix

b) Nearest Neighbor from Tucson

c) Nearest Neighbor from Flagstaff

d) Sorted Edges

3. Find a shorter Hamilton circuit than any of those in problems 2 using a combination of geographic knowledge, trial-and-error, common-sense and/or pure luck! Again list the route and compute the length of this circuit.