Consider the following cost matrix to solve a warehouse location problem to minimize the total

setup and transportation costs. 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

breaks the ties?