Question $2$:

Consider the network in the figure below. In this network, the values on the links indicate the lengths of the links, and the nodes $\{A,B,C,D,E\}$ in the network indicate potential facility locations and customers.

For the $2-$median problem where all demands are equal and have no weight,

a$)$ Find a solution using the greedy heuristic algorithm.

b$)$ Try to improve the solution found with the greedy heuristic using the Teitz and Bart algorithm.