Solve with Excel please

A traveling salesman problem with 5 cities needs to be solved The distances between cities are given in the following table 3 2 1 from/to 5 4 11.2 4.9 10.7 12.3 1 1.2 6 6 2.1 12.3 2 N 2.3 5.1 2.1 10.7 3 5.7 5.1 4.9 4 5.7 2.3 1.2 11.2 5 5 000 Find the route to visit all cities once to minimize the total traveling distance All the decision variables should be binary A This problem can be solved by using Integer decision variables 6 Route 2-4-3-1-5-2 is a feasible route in this problem The value of z the optimal solution is 22.4 D This is a maximization problem 6 One of the optimal routes is visiting the cities in the following order 1-4-3-2-5-1 There is no need to use Big Min the modeling of this