1.1.1.2.1.3:24:05.6.1:71: 89:110: 11/ 112 113 114 115 116 117 18 19.1.20 Question 3 A Greedy Algorithm for the k-Center Problem 00 Locate: First facility at optimal 1-center location using total enumeration Input: Coordinates for facilities and customers for the distance matrix) K Demands for customers (f available) Yes Have we located (opened) k centers 2 No STOP Locate the next center at optimal location (using total enumeration) holding the locations of opened centers fixed. (Customers are reassigned among the open facilities.) (2 3 ith e al time A)Apply the given algorithm (see the flow chart) for the numerical instance that is presented above. Adopt "Manhattan Distance" and solve the problem for "k=3". (15 points). If a customer has the same "Manhattan" distance to multiple centers. It is assigned to the center that has the lowest index value. B) What is the computational complexity of this algorithm for general "2" (number of customers) and "m" (number of candidate center locations) and "k" is the number of centers, Explain! (5 points) colved LE Chat Share Screen Record Reactions