and write down the path you found

write down the distance you found

1. (25 points) Consider the traveling salesperson problem. Your logistics company has a truck located at City 2. The truck must visit all other cities (Cities 1, 3, 4 and 5) to deliver some goods and return back to City 2. The corresponding travel distances are given in the following table: To City 1 City 2 City 3 City 4 City 5 City 1 0 112 119 154 106 City 2 77 O 86 69 158 From City 3 54 128 O 87 113 City 4 51 127 95 0 126 City 5 72 79 78 100 0 Find a solution by using "Cheapest-insertion method" (the tour must start from City 2). What is the total distance of your solution? Show and explain your steps in the following table