Consider the following cost matrix to solve a Warehouse location problem to mimize the total setup and transportation costs. Cust. Loc. Warehouse sites B c 1000 100 1 100 200 2 200 3 1000 500 300 500 500 Fixed Cost 300 What is the largest integer value for X (fixed cost of cite C) for which the greedy algorithm we have seen in the class gives a solution that is not optimal, regardless of how one break the ties