Consider the data shown below. The DC is located at node 0. Each truck has a capacity of 350 units. The maximum distance that a vehicle can travel is 50 miles. Assume that all distances are on a Euclidean plane so that the distance from point j to point k is defined as d(j,k)- SQRT(x(j)-x(k))^2 + (y(j)-y(k))^2]. 1. Use the sweep algorithm to find the best routes beginning with node 8 and proceeding counterclockwise. a) How many routes did you use? b) What is the total route length? c) For each route, list the nodes visited (in sequence), the demand associated with that route, and the route length. 2. Use the sweep algorithm to find the best routes beginning with node 1 and proceeding counterclockwise. a) How many routes did you use? b) What is the total route length? c) For each route, list the nodes visited (in sequence), the demand associated with that route, and the route length. 3. Compare and contrast these two solutions. How would you improve them? Node X-coord Y-coord Demand 0 0 0 0 1 5 7 65 2 3 5 95 3 456 653 -6 100 -1 85 -9 60 -7 -6 7 3 -8 68 110 100 8 7 2 9 -3 4 10 -4 8 565 85 60 75