Question 4: The Mukonsel compury is a fully connested supply thuin thul produces gouds in production cenlers (Atlantu, Isirmingham, and Nashille) and sells them at its markets or retail outlets in Pitsburgh, Detroit, and Richmond. After cities in Indianapolis, Columbus, or Richmond for final delivery. The possible logistic paths and their travel times (hrs) are listed in the table below: Part a) Use dynamis programming to find the shortest path for delivering products from Atlanta to Detroit. (Detine stagcs and statcs, shaw all tables and firtal solution) The tables below show other costs and capacities. The transportation cost is 0.01 (Whour per product). Part b) Formulate the problem as a linear programming model to tind the best logistic strategy for this supply chain. Pat c) Use software to solve the problem (Show the sereen shot of the setting window and results) Part d) Investigate the cfrects of transportation eapacity on total protit (Be creative, no specific requirement) Part e) If we assume that there is also another option to send items by airplane from plants to markets with total costs (production + transportation) listed in the helow table, use transportation simplex to find optimal transportation plan (You need to ignore intermediate stapes and only focus on demand and supply data listed in the tables)