1 Apply a greedy heuristic to the following instance of the uncapacitated facility location problem: there are rn = 6 clients and n = 4 depots, and costs as shown below: 6 2 3 4 1 9 4 11 15 2 6 3 (T,j)=19 11 4 8 7 23 2 9 (5) = (21, 16, 11, 24) 1 Apply a greedy heuristic to the following instance of the uncapacitated facility location problem: there are rn = 6 clients and n = 4 depots, and costs as shown below: 6 2 3 4 1 9 4 11 15 2 6 3 (T,j)=19 11 4 8 7 23 2 9 (5) = (21, 16, 11, 24)