Question

Problem 4 Shortest Path Problem-15 points You are in the market for a new car and a new car costs $10,000. The annual operating costs and resale value of a used car are shown in the Table below. e of Car (Years) Resale Value (S) Costs (S) 300 (year 1) 500 (year 2) 800 (year 3) 1200 (year 4 1600 (year 5) 2200 (year 6) 8000 6000 5000 3000 1500 Assuming that you now have a new car, determine a replacement policy that minimizes the net costs of owning and operating a car for the next six years. a. We will formulate this problem as a shortest-path problem by drawing a network where seven nodes represent whether you buy a new car in each of the years. Node 1 represents the beginning of year 1, then node 7 represents the end of year 6 (or the beginning of year 7). The length of the arcs are defined based on the costs. For example, the arc from year 1 to year 2 represents that you own your car for 1 year and buy a new car in year 2. Thus the costs associated with arc 1-2 is thus 2300 (which is 300 to operate for 1 year, 10,000 to buy a new car, minus the salvage value for a 1-year old car of-8000) Provide the values of the costs for the remaining open cells. Hint, there is a pattern. [7 points Arc Costs1 6 2300 b. Apply an algorithm (such as Dijkstra's algorithm) to solve the shortest path problem. What is the optimal car replacement policy? How much does it costs to own and operate your car for the next six