UNIVERSITY OF NEW BRUNSWICK Faculty of Management Homework Assignment #2 ADM 4656 Professor: Dr. H.A. Eiselt Due date: 10/17/2022, 5 p.m. Name: I.D.#: Question 1 (1 mark): Consider the graph below & assume that the number of customers at the nodes ni, ..., 75 is 30, 50, 40, 60, & 50, respectively. 14 3 4 14 125 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.|