$1-$ Please Solve the TSP below by using Python $($pyomo framework and suitable solver$)$

Challenge Problem $-$ Traveling Salesman Problem $($TSP$)$

Joe State lives in Gary, Indiana. He owns insurance agencies in Gary, Fort Wayne, Evansville, Terre Haute, and South Bend. Each December, he visits each of his insurance agencies. The distance between each agency $($in miles$)$ is given in an excel file $($as below$).$ What order of visiting his agencies will minimize the total distance traveled?

Suppose the TSP consists of cities $1,2,3,...,N$

$\backslash$table$[[,$City$1,$city$2,$City $3,$City$44,$city $6],[$City$1,0,132,217,164,58],[$city$2,132,0,290,201,79],[$city $3,217,290,0,113,303],[$City $4,164,201,113,0,196],[$city$5,58,79,303,196,0]]$