Following is the Business decision analytics under uncertainty homework question. Please help me solve it.

1) [Traveling Salesman Problem]: It is the last weekend of the 2004 election campaign, and candidate Tony is in New York. Before election day, Tony must visit Miami, Chicago and Dallas and return to his NY headquarters. Tony wants to minimize the total distance he must travel. New York Miami Dallas Chicago The distance among the cities are given as in the table above, (e .g, distance from Dallas to Chicago is 900 miles). Based on this information answer the following questions: i. Write the dynamic programming, in particular clearly dene states, stages and value function. ii. What is the minimum distance that Tony has to travel? iii. State the all possible routes that he can travel in his campaign with this minimum cost. Hint: You may nd network problem helpful to determine the possible decisions at each state