Please Answer Part (c) Only

8.3-4.* The coach of an age group swim team needs to assign swimmers to a 200-yard medley relay team to send to the Junior Olympics. Since most of his best swimmers are very fast in more than one stroke, it is not clear which swimmer should be assigned to each of the four strokes. The five fastest swimmers and the best times in seconds) they have achieved in each of the strokes (for 50 yards) are Stroke Carl Chris David Ken Backstroke Breaststroke Butterfly Freestyle 37.7 43.4 33.3 29.2 32.9 33.1 28.5 26.4 33.8 42.2 38.9 29.6 Tony 37.0 34.7 30.4 28.5 35.4 41.8 33.6 31.1 The coach wishes to determine how to assign four swimmers to the four different strokes to minimize the sum of the correspond- ing best times. (a) Formulate this problem as an assignment problem. C (b) Obtain an optimal solution. (c) Formulate this assignment problem using LINGO'S modeling language (note that the model should be similar to the one for the transportation problem). Define sets, such as strokes, swimmers, and assignments (stroke-swimmer pairs). The only data in the data section should be the square cost matrix. Verify the optimal solution by comparing it with the one obtained in (b). 8.3-4.* The coach of an age group swim team needs to assign swimmers to a 200-yard medley relay team to send to the Junior Olympics. Since most of his best swimmers are very fast in more than one stroke, it is not clear which swimmer should be assigned to each of the four strokes. The five fastest swimmers and the best times in seconds) they have achieved in each of the strokes (for 50 yards) are Stroke Carl Chris David Ken Backstroke Breaststroke Butterfly Freestyle 37.7 43.4 33.3 29.2 32.9 33.1 28.5 26.4 33.8 42.2 38.9 29.6 Tony 37.0 34.7 30.4 28.5 35.4 41.8 33.6 31.1 The coach wishes to determine how to assign four swimmers to the four different strokes to minimize the sum of the correspond- ing best times. (a) Formulate this problem as an assignment problem. C (b) Obtain an optimal solution. (c) Formulate this assignment problem using LINGO'S modeling language (note that the model should be similar to the one for the transportation problem). Define sets, such as strokes, swimmers, and assignments (stroke-swimmer pairs). The only data in the data section should be the square cost matrix. Verify the optimal solution by comparing it with the one obtained in (b)