Shortest Route I. A company must move 50 units of product from its factory in Los Angeles to a wholesaler in New York. The shipment may pass through any of its various depots. The table below presents the transportation cost/unit between locations. Draw the network diagram. Find the cheapest route for the shipment. Use Dijkstra's Algorithm to solve the problem. Table 1: Costs Between Locations From/To Los Angeles San Francisco Phoenix Laramie St. Louis Chicago New York Los Angeles San Francisco Phoenix Laramie St. Louis Chicago New York