Problem $4.[25$ point$]$ Subdivisions of a city, $1,2,$ and $3,$ are located at the points $P1(0,2),P3(5,1),P2(2,6)$ respectively. We would like to locate a government office to serve all subdivisions. However, because of many existing obstacles such as buildings and lakes, we decided to consider only $5$ tandidate locations such as $(0,2),(5,1),(2,6),(2,2),(3,3).$ Since the population of each subdivision is the same, we assume that $W1=W2=W3.$ Formulate the problem as a Single Minisum discrete problem and solve it by AMPL.