yea comparing network path year by year successively

I need the network path in successive years and how to compute the shortest distance

Felix Car Renting Service is developing a replacement policy for its car fleet for a 5-year planning horizon. At the start of cach year, a decision is made as to whether a car should be kept in operation or replaced. A car must be kept in service at least 2 years, with a maximum service life of 4 years. The following table provides the replacement cost as a function of the year a car is acquired and the number of years in operation. Table 2: Felix Car Renting data Replacement cost (GHC) for given years in operation Year acquired 2 3 1 300 410 680 2 400 480 700 420 530 720 480 $70 (a) Represent this problem as a network. (b)i. Estimate the shortest path from the start node to the end node. ii. Discuss your answer in (b) above. (C) Assess the total cost corresponding to this solution? AN(8 Marks) AN(6 Marks) AP(2 Marks) AP(4 Marks)