Please send it in less than an hour.

I know only A will be answered, but answer B if possible.

Question 1 (15+5-20 points) Problem Definition: Capacitated p-median problem aims to locate p medians out of n candidate locations such that all customers are served by one of the medians. The objective is to minimize the total distance of customers to the medians such that the capacity Q of each median is not exceeded. Algorithm Definition: Capacitated analytical center algorithm for p-median problem takes the analytical center of the customers' locations that are unassigned to any given median (i.e., the mean of x and y coordinates) and locates the next median to the location that is closest to the analytical center. Next, the closest unassigned customers to the recently located median are located until the capacity of the median is occupied. Assigned customers are removed from the list of unassigned customers and they are not reassigned in later iterations. The procedure continues until p-medians are located. If multiple customer has the same "Manhattan" distance to a median, the customer with the lowest index is assigned to the median. A) Apply the given algorithm for the above given network where circles denote the customers and squares denote the candidate locations for medians. Suppose for each facility 3(=Q) customers can be assigned and Manhattan (or taxi cab) distance measure is used and k-3. (15 points) B) Is it an exact algorithm? if the answer is yes, prove it; otherwise, give a counter example. (5 points)