w(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method). Truck/Route B C 9 5 10 14 8 10 13 15 Step la: Row subtraction (show your steps, e.g., see cell 1A) Truck/Route A B 7-5=2 Step 1b: Column subtraction. 1 2 3 4 Conclusions: 1 2 3 4 Truck/Route 3 4 1 2 1 2 3 4 A 7 13 9 12 A = Truck 1 to Route Truck 2 to Route Truck 3 to Route Truck 4 to Route Total costs= B Step 3: Revise the opportunity cost table (show your calculation steps) Truck/Route A B 11 Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? C C Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? C D 11 9 6 8 D D D (show calculation ste

Step 1h: Column subtraction. Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? Step 3: Revise the opportunity cost table (show your calculation steps) Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? Conclusions: Truck I to Route Truck 2 to Route Truck 3 to Route Truck 4 to Route Total costs = (show calculation st Step 1b: Column subtraction. Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? Step 3: Revise the opportunity cost table (show your calculation steps) Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? Conclusions: Truck 1 to Route Truck 2 to Route Truck 3 to Route Truck 4 to Route Total costs = (show calculation steps)