Given the following TSP file, provide all possible permutations and calculate their tours. Make a note of the tour with the fastest route. For this we can start at any city we want, but we must go back to that city. You can leave answers in square root form if you'd like. The distance equation you probably are wondering about using is as follows: NAME: RandomTSE TYPE: TSP COMMENT 3 Random Towns with Random Points DIMENSION: 3 EDGE WEIGHT_TYPE: EUC 2D NODE COORD SECTION 1 6 2 2 5 4 3 2 6 EOF Given the following TSP file, provide all possible permutations and calculate their tours. Make a note of the tour with the fastest route. For this we can start at any city we want, but we must go back to that city. You can leave answers in square root form if you'd like. The distance equation you probably are wondering about using is as follows: NAME: RandomTSE TYPE: TSP COMMENT 3 Random Towns with Random Points DIMENSION: 3 EDGE WEIGHT_TYPE: EUC 2D NODE COORD SECTION 1 6 2 2 5 4 3 2 6 EOF