Question 1. TSP Problem Consider the problem of finding the shortest distance cycle through the following six delivery points, given that the cycle visits each delivery point exactly once. The coordinates of the six delivery points are given in Table below. Starting Point Demand Point 1 Demand Point 2 Demand Point 3 Demand Point 4 Demand Point 5 Demand Point 6 X 0 20 90 40 10 30 Y 0 90 20 30 10 60 70 80 (a) Please formulate the TSP of this problem using Integer Programming. (b) Please develop the distance table. (c) Please find a TSP solution of this problem using nearest insertion. (d) Please find a TSP solution of this problem using Clarke and Wright (C-W) Savings. Question 1. TSP Problem Consider the problem of finding the shortest distance cycle through the following six delivery points, given that the cycle visits each delivery point exactly once. The coordinates of the six delivery points are given in Table below. Starting Point Demand Point 1 Demand Point 2 Demand Point 3 Demand Point 4 Demand Point 5 Demand Point 6 X 0 20 90 40 10 30 Y 0 90 20 30 10 60 70 80 (a) Please formulate the TSP of this problem using Integer Programming. (b) Please develop the distance table. (c) Please find a TSP solution of this problem using nearest insertion. (d) Please find a TSP solution of this problem using Clarke and Wright (C-W) Savings