Transportation Problem: Algorithm Using the "Northwest Corner Method" & the "Method of Multipliers" solve the following problem. The following matrix summarizes the cost matrix of Logistics Co. D1 D2 D3 D4 SI S2 S3 S4 Demand 14 17 23 20 21 16 21 27 18 41 20 17 16 10 31 17 15 13 12 26 Supply 28 36 36 19 Using the "Method of Multipliers" the 1st entering variable is: * X44 X21 X43 X11 0 This is a required question Using the "Method of Multipliers" the value of the reduced cost at the 1st entering variable is: * 9 5 2 8 O This is a required question Using the "Method of Multipliers" the 1st closed loop consists of cells * X43, X44, X34, X31 X21, X11, X12, X22 X43, X44, X34, X33 X21, X11, X12, X23 This is a required question Using the "Method of Multipliers" the value of "01" is * 19 2 21 6 This is a required question Using the "Method of Multipliers" the 1st Leaving variable is * X44 X21 X43 X11 O This is a required question Using the "Method of Multipliers" the 2nd entering variable is * X44 X21 X43 X11 This is a required question Using the "Method of Multipliers" the 2nd closed loop consists of cells * X43, X44, X34, X31 X21, X11, X12, X22 X43, 44, X34, X33 X21, X11, X12, X23 This is a required question Using the "Method of Multipliers" the value of "02" is * 19 2 21 6 This is a required question Using the "Method of Multipliers" the 2nd Leaving variable is * X44 X21 X43 X11 This is a required question The "minimum" transportation cost resulting after the two iterations equals $8100 $1008 $1800 $8001 O This is a required question Using the "Northwest Corner Method" the basic cells are: X13, X14, X21, X24, X31, X32, X41, X42, X43 X11, X12, X22, X23, X33, X34, X43 X13, X14, X21, X24, X31, X32, X41, X42, X44 X11, X12, X22, X23, X33, X34, X44 Using the "Northwest Corner Method" the "non-basic cells" are: * X13, X14, X21, X24, X31, X32, X41, X42, X43 X11, X12, X22, X23, X33, X34, X44 X13, X14, X21, X24, X31, X32, X41, X42, X44 X11, X12, X22, X23, X33, X34, X43