Please use Lingo and posted the code!

A helicopter at location 0, which is at an offshore supply base in Toronto, needs to visit all four offshore platforms on one trip. These platforms are denoted as loca- tions 1, 2, 3, and 4. The distance in km that it would take a helicopter to travel from one location to another is given in the following table. Because these are distances in the air, the table is symmetric. From 0 1 2 3 4 0 1 0 219 219 0 286 70 150 94 418 261 2 3 4 286 150 418 70 94 261 0 164 210 164 0 349 210 349 0 The objective is to minimize the total travel time. (a) Give the algebraic model of this situation, omitting the sub-tour constraints. (b) Use LINGO or the Excel Solver to solve this (partial) model. Show that this solution is not a tour, and state the two sub-tours. (C) Give a constraint that would, if added to the formulation of (b), prevent this specific situation from arising. Re-solve the computer model, and state whether or not this new solution is a tour. (d) If necessary, repeat () until a tour is obtained