\(U, W, X, Y, Z\)

Use your solutions to Exercises 25-30 and the nearest neighbor method to find a Hamilton cycle to solve the traveling salesperson problem of finding a reasonably short route to leave from city \(U\), visit each of the other cities listed and return to city \(U\). Indicate the distance required to travel the route you found.