Equipment replacement

a RentAClunker wants to create a new replacement policy for its delivery vehicles over a 4-year horizon. At the beginning of each year, a vehicle is either replaced or kept running for an additional year. A vehicle is in service from 1 to 3 years. The table shown below indicates the replacement costs, based on which year the vehicle is acquired and number of years the vehicle is in operation. Replacement cost ($) for given years in operation 1 2 3 Equipment acquired at start of year 1 2 3 4 4000 4300 4800 4900 5400 6200 7100 9800 8700 (20 points) (a) Construct a network representation of this problem. Upload a screenshot of your work. (40 points) (b) Dijkstra's Algorithm setup: Fill in this table to complete the 1st line of Dijkstra's algorithm. Iteration # Node or Vertex This vertex's neighbors & distances to these neighbors Shortest distance Previous from Starting (or node, Warehouse preceding vertex) #1 1st 1 a RentAClunker wants to create a new replacement policy for its delivery vehicles over a 4-year horizon. At the beginning of each year, a vehicle is either replaced or kept running for an additional year. A vehicle is in service from 1 to 3 years. The table shown below indicates the replacement costs, based on which year the vehicle is acquired and number of years the vehicle is in operation. Replacement cost ($) for given years in operation 1 2 3 Equipment acquired at start of year 1 2 3 4 4000 4300 4800 4900 5400 6200 7100 9800 8700 (20 points) (a) Construct a network representation of this problem. Upload a screenshot of your work. (40 points) (b) Dijkstra's Algorithm setup: Fill in this table to complete the 1st line of Dijkstra's algorithm. Iteration # Node or Vertex This vertex's neighbors & distances to these neighbors Shortest distance Previous from Starting (or node, Warehouse preceding vertex) #1 1st 1