A salesman located on a city A decided to travel to city B. He knew the distances of alternative routes from city A to city B. He then drew the highway network map as shown below. The city of origin, city A, is city 1. Destination city, city B, is city 10. Other cities through which the salesman will have to pass are given the numbers 2 to 9. The arrows represent routes between cities and distances in km are indicated for each route. The salesman?s problem is to find the shortest route that covers all of the selected cities from city A to city B.

i Q *2" IIDI'A:*U19%16:59 Question No4 A salesman located on a city A decided to travel to city B. He knew the distances of alternative routes from city A to city B. He then drew the highway network map as shown below. The city of origin, city A, is city 1. Destination city, city B, is city 10. Other cities through which the salesman will have to pass are given the numbers 2 to 9. The arrows represent routes between cities and distances in km are indicated for each route. The salesman's problem is to find the shortest route that covers all of the selected cities from city A to city B. SELECTALL CUT COPY PASTE --- Answer 1. The problem leaves with this matrix: x1 x2 x3 RHS x4 5* 2 3 15 mm \"H\" I'. III Iml Fl