plese explain

S (2) Find an optimal solution for the following transportation problem. To Valley Town Junction Burg (B) Supply FROM Madison SS $3 $6 $7 (M) 300 350 50 Yonkers S2 S8 si $9 400 200 600 Pittsburgh $11 $10 S8 $3 (P) 50 200 250 Demand 300 450 250 200 1,200 The above feasible plan (1.c., 300 from M to V, etc.) is obtained by applying the Northwest Corner Rule, and its total cost = 300(55) + 50(83) + 400($8) +200($1) + 50(580) + 200(530) = $6,050. Using the Stepping-Stone method to find an optimal plan. The improvement indices (below) To Valley Town Junction Burg are determined as follows: FROM () (1) (B) Supply_(row M first, then rows Y and P) Madison S5 $3 $6 $7 MJ: 6-1 +8 -3 = 10 (M) 300 50 350 MB: 7-3 +8 -1 +8 -3 -16 Yonkers $2 $8 $1 $9 YV: 2-5 +3-8--8* 400 200 600 YB: 9-3 +8 -1 = 13 Pittsburgh $11 $10 $8 $3 PV: 11 -5 +3-8 +1-8= -6 (P) 50 200 250 PT: 10-8 +1-8-5 Demand 300 450 250 200 1,200 the "most negative index" We focus on cell YV (index --8). Its closed path is: YV to MV to MT to YT, back to YV. To increase the quantity in YV, we need to adjust MV down, MT up, and YT down. Therefore, the next improved plan is: To Valley Town Junction FROM Part b) Determine the Indices: (D J Madison $5 Supply Crow M first, then rows Y and P) $3 $6 $7 (M) 350 Yonkers 350 $2 $8 Si (Y) 300 $9 100 200 Pittsburgh $11 600 $10 $8 $3 (P) Demand 50 200 300 250 450 250 200 1,200 Asterisk the "most negative index" Burg Parta) Find the new TC- (show steps). Parte) Determine the next improved plan, TO Valley Town Junction FROM Madison S6 Burg SS Parte) Determine the Indices: Supply row first, then rows Yand P) $3 (M) $7 350 Parta) Find the new TC (show steps). Burg (B) Parte) Determine the Indices: Supply Krow M first, then rows Y and P) $7 350 $9 Parte) Determine the next improved plan. Valley Town Junction FROM (T) Madison S5 $3 $6 (M) Yonkers $2 $8 $1 (Y) Pittsburgh $11 SIO $8 (P) Demand 300 450 250 Part d) Find the new TC Part 1) is the current solution optimal? Explain 600 $3 200 250 1,200 Asterisk the "most negative index" (show steps) (hint: see p.352)