A truck must travel from New York to Los Angeles. As shown in the below Figure, a variety of routes are available. The number associated with each arc is the number of gallons of fuel required by the truck to traverse the arc. DVIN AN Die Network for Problem 1 1800 Cleveland 400 400 Los New York St. Louis Angeles 800 1000 600 1200 Nashville Salt Lake City 2 Telephone calls from New York to Los Angeles are transported as follows: The call is sent first to either Chicago 3 Before a new product can be introduced, t Table 40 must be completed (all times are in. 1) Formulate as an MCNFP the problem of finding the New York to Los Angeles route t uses the minimum amount of gas. 2) Use Dijkstra's algorithm to find the route from New York to Los Angeles that uses the minimum amount of gas. 3) Use Excel solver and Lingo to find the optimal solution and verify your answer. 950 900 1100 600 600 Phoenix 900 Dallas