Use the same problem you used for your topic#9 homework. If that problem was not a regular one, ask me to assign a different problem to you (same rules as before: cost factors between 1-20; not more than one duplicate number in any specific row and no duplicate numbers in any specific column; balanced transportation problem with a specific total demand/supply value either 1600, or 1800 total supply/demand; no similar values of supply and demand and the difference between the largest value assigned and the smallest value assigned should not be more than 100). - 1. Find basic feasible solution using Minimum Cost Method. 2. Compare that result with the optimal solution from LINDO. If they are the same, then find the basic feasible solution using the NWC method. 3. Perform ONE complete iteration of Transportation algorithm (that is, find the entering variable, find the loop, find new basic feasible solution, identify whether that solution is optimal or not.) 112 3 10 iz 65 7 Tis 116 4 8 55 3 18 1375 15 60 17 119 214 120 50 40 35 50 40 20 60