A facility complex where there are 5 existing department (D1, D2, D3, D4, D5) around a central courtyard or circulation space area for material handling and setup and storage. Two new facilities (F1 and F2) to serve the 5 departments are going to be located at two of the 3 points {A, B, C} in the courtyard. You wish to find the location of F1 and F2 that minimizes the total distance traveled in two-way trips to and from the existing departments. The number of two-way trips per day is (20, 5, 10, 5, 15) and (20, 20, 10, 0, 8) for F1 and F2, respectively. Assume that travel is initiated from the central location of the departments, as indicated by their coordinates: Department (x, y): D1 (1, 7), D2 (7, 12), D3 (15, 7), D4 (12, 2), D5 (4, 3). Point (x, y): A (6, 8), B (10, 8), C (7, 5). The rule to locate the facility is: each facility can only be located to one point; each point can only locate one facility. The worst case is:

1 F1 to A, and F2 to B

2 F2 to A, and F1 to B

3 F1 to C, and F2 to B

4 None of them

5 F1 to B, and F2 to C