(3 points) Here is the initial tableau (by the North West method) of a Min transportation problem. Demanders 1 2 3 Supply Dual(u) 115 10 8 5 10 4 17 .14 9 B0 2 11 O9 08 67 10 B12 14 31508050 0 N 9 B 20 B 1 B 30 Demand 19 2 1 20 Dual(v) 15 13 6 Using the Loop method fill in the values of the next tableau Each 2x2 matrix is the relevant square in the tableau. (For grading convenience, in bottom right corner of each box use 1 for "B" and 0 for "N") Hotlieb (3 points) Here is the initial tableau (by the North West method) of a Min transportation problem. Demanders 1 2 3 Supply Dual(u) 115 10 8 5 10 4 17 .14 9 B0 2 11 O9 08 67 10 B12 14 31508050 0 N 9 B 20 B 1 B 30 Demand 19 2 1 20 Dual(v) 15 13 6 Using the Loop method fill in the values of the next tableau Each 2x2 matrix is the relevant square in the tableau. (For grading convenience, in bottom right corner of each box use 1 for "B" and 0 for "N") Hotlieb