1. Morgan Trucking Company operates a special pickup and delivery service between Chicago and six other cities located in a four state area. When Morgan receives a request for service, it despatches a truck from Chicago to the city requesting service as soon as possible. With both fast service and minimum travel costs as objective for Morgan, it is important that the dispatched truck take the shortest route from Chicago to the specified city. Assume that the following network (not drawn to scale) with distances given in miles represents the highway network for this problem. Find the shortest route distances from Chicago to node 6. 2 12 5 35 8 10 Chicago 20 30 1 20 3 6 20 5 9 15 4 7