The following matrix represents a warehouse location problem. There is a fixed cost for opening any of the five possible warehouses, and the cell entries for each customer are the variable costs of serving that customer from each potential warehouse. The variable costs include inbound transportation, outbound transportation, and warehouse operating costs for all the customer's requirements. The objective is to determine which warehouses should be used to serve all customers at minimum total cost. There are no capacity restrictions on the potential warehouses, but some warehouses cannot serve some customers.

$\backslash$table$[[\backslash$table$[[$Warehouses$],[$Possible$]],\backslash$table$[[$Fixed$],[$Costs$]],$Customers$],[2,3,4,5,6,,],[$B$,6,5,2,2,6,6,,],[$C$,5,7,$X$,8,9,2,6,],[$D$,8,4,3,7,5,6,4,],[$E$,8,6,2,6,6,4,8,]]$

Note: $x$ indicates no service is possible between warehouse and customer.

Apply the add procedure to solve this warehouse location problem. Determine which warehouse should service each customer and indicate the total cost of your solution.