Question 1 I_| 1 mark}: Consider the graph below & assume that the number of customers at the nodes m. ..., n3 is 30. 50. 4D. 60. (it 50. respectively. Given a service standard of D = 2. solve the max cover problem for two available facilities with the greedy heuristic. followed by the SWAP procedure. (In case of a tie. use the solution with the variable. that has the smaller subscript). Repeat the question for p = 3 facilities to be located