hi for part b please use dijkstra's algorithm

10.3-3. At a small but growing airport, the local airline company is purchasing a new tractor for a tractor-trailer train to bring luggage to and from the airplanes. A new mechanized luggage system will be installed in 3 years, so the tractor will not be needed after that. However, because it will receive heavy use, so that the running and maintenance costs will increase rapidly as the tractor ases, it may still be more economical to replace the tractor after I of 2 years. The following table gives the total net discounted cost as s.5ciailed with purchasing a tractor (purchase price minus [rade in year i and trading it in at the end of year j (where year ) is now). The problem is to determine at what times (if any) the tractor should be replaced to minimize the total cost for the tractors over 3 years. (a) Formulate this problem as a shortest-path problem. (b) Use the algorithm described in Sec. 10.3 to solve this shortestpath problem. c (c) Formulate and solve a spreadsheet model for this