12 10 12 Question 4: (20 points) (This question can be solved in 20 minutes easily) A manufacturer has 4 depots and retailers all in different cities. Capacities of the depots, demands of the retailers, unit transportation costs from the depots to the retailers and an initial basic feasible solution are given in the following table. Use the given solution as your initial basic feasible solution and find the optimal solution by the Transportation Simplex Algorithm. Retailer 1 Retailer 2 Retailer 3 Retailer 4 Retailers Capacity Depot 1 5 10 55 5 Depot 2 65 20 25 60 10 5 11 Depot 3 45 12 Depot 4 50 Demand 6 12 6 10 13 10 8 10 45