3. This question should be answered on the sheet provided. The table below gives distances, in miles, for a network relating to a travelling salesman problem. Use dynamic programming to find the route which satisfies the wish of the organisers. State the length of the shortest stage on this route.