Min Z= 8X11+6X12+10X13+9X14+9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34 S.T.: Xu+X12+X13+X14= 45 (Demand Constraints) X12+X22+X32 >= 20 X13+X23+X33 >= 30 X14+X24+X34 >= 30 Xij >= 0 (i=1,2,3; j= 1,2,3,4) 1. Solve the above LP problem using the LINDO and report the solutions. 2. Draw the network of the transportation problem based on the optimal solutions. For example, draw the plants (i) in one side and the cities () another side, then draw the lines between i and j with values. 3. Add the Balance Constraints into the above mathematical problem, then solve it using the LINDO and report the solutions with drawing the network. 4. From the solution in (1) and (3), what is your conclusion? Min Z= 8X11+6X12+10X13+9X14+9X21+12X22+13X23+7X24 +14X31+9X32+16X33+5X34 S.T.: Xu+X12+X13+X14= 45 (Demand Constraints) X12+X22+X32 >= 20 X13+X23+X33 >= 30 X14+X24+X34 >= 30 Xij >= 0 (i=1,2,3; j= 1,2,3,4) 1. Solve the above LP problem using the LINDO and report the solutions. 2. Draw the network of the transportation problem based on the optimal solutions. For example, draw the plants (i) in one side and the cities () another side, then draw the lines between i and j with values. 3. Add the Balance Constraints into the above mathematical problem, then solve it using the LINDO and report the solutions with drawing the network. 4. From the solution in (1) and (3), what is your conclusion