Hello can you please show all the steps for a-d.

For step B please clearly state the assignment model and then clearly state the linear programming. Also for the excel portion please show the formulas used and include the excel solver screenshot of the variables that were inputted.

For step C Please show the different branches, (not the list version)

Please give a through explination

there are a few answers already on chegg that do not go through all the steps. Please do not copy their work and please do all the steps, it would really be appreciated.

A book salesperson who lives in Basin must call once a month on four customers located in Wald, Bon, Mena, and Kiln before returning home to Basin. The following table gives the distances in miles among the different cities: Miles between cities Basin Wald Bon Mena Kiln 220 120 0 80 Basin Wald Bon Mena 0 120 220 150 150 110 160 0 210 130 185 190 80 0 160 110 Kiln 210 130 185 1900 The objective is to minimize the total distance traveled by the salesperson. a. Write down the LP for computing a lower-bound estimate on the optimum tour length. b. Compare the lower bounds on the optimum tour length using both the assignment model and linear programming. Is the assignment model solution optimum for the TSP? Solve using excel solver. (Hint: in the assignment model replace 0 in the matrix with 1000 (M) to remove the diagonal) c. Solve by B&B using the assignment model as a lower bound. d. Comment on the results of c. A book salesperson who lives in Basin must call once a month on four customers located in Wald, Bon, Mena, and Kiln before returning home to Basin. The following table gives the distances in miles among the different cities: Miles between cities Basin Wald Bon Mena Kiln 220 120 0 80 Basin Wald Bon Mena 0 120 220 150 150 110 160 0 210 130 185 190 80 0 160 110 Kiln 210 130 185 1900 The objective is to minimize the total distance traveled by the salesperson. a. Write down the LP for computing a lower-bound estimate on the optimum tour length. b. Compare the lower bounds on the optimum tour length using both the assignment model and linear programming. Is the assignment model solution optimum for the TSP? Solve using excel solver. (Hint: in the assignment model replace 0 in the matrix with 1000 (M) to remove the diagonal) c. Solve by B&B using the assignment model as a lower bound. d. Comment on the results of c