Please post with excel and solver

As a graduation present to yourselves, you are planning a 7 city Florida tour. A website provided information on driving times between the various cities and towns, as shown in the table below. (Driving times are given in hours.) You would like to visit each of the places once and return to your starting point. FP CL 0.9 0 CB 3.3 3.3 0 1.5 DB 3.4 3.3 1.5 0 BR Bradenton 0 Clearwater 0.9 Cocoa Beach 3.3 Daytona 3.4 Beach Ft. Lauderdale 4.2 Ft. Myers 1.7 Ft. Pierce 3 FL 4.2 5.3 3.8 5 FM 1.7 2.5 4 4.3 ! 3 3 1.3 2.6 3.3 3.3 5.3 2.5 3.4 Auw 3.8 4 1.3 5 4.3 2.6 0 2.8 2 2.8 0 2.5 1.9 2.5 0 Develop a model to determine the shortest path (in hours) for the tour. Each step of the TSP will be on a separate sheet. If you reach the point where you have added 5 constraints, then stop and turn in what you have. Use the sub-tour elimination process from Chapter 7 of the text. As a graduation present to yourselves, you are planning a 7 city Florida tour. A website provided information on driving times between the various cities and towns, as shown in the table below. (Driving times are given in hours.) You would like to visit each of the places once and return to your starting point. FP CL 0.9 0 CB 3.3 3.3 0 1.5 DB 3.4 3.3 1.5 0 BR Bradenton 0 Clearwater 0.9 Cocoa Beach 3.3 Daytona 3.4 Beach Ft. Lauderdale 4.2 Ft. Myers 1.7 Ft. Pierce 3 FL 4.2 5.3 3.8 5 FM 1.7 2.5 4 4.3 ! 3 3 1.3 2.6 3.3 3.3 5.3 2.5 3.4 Auw 3.8 4 1.3 5 4.3 2.6 0 2.8 2 2.8 0 2.5 1.9 2.5 0 Develop a model to determine the shortest path (in hours) for the tour. Each step of the TSP will be on a separate sheet. If you reach the point where you have added 5 constraints, then stop and turn in what you have. Use the sub-tour elimination process from Chapter 7 of the text