In Java please

(2) Hospital Builder Program On the next page, there are 4 grid-based maps each with 5 small towns shown as red squares. We would like to write a program that determines the roptimal grid location to build a hospital so that it lies at a distance that minimizes the travel from each town. That is the furthest distance that a town resident has to travel in order to reach the hospital is kept to a minimum. The answer is shown as a green circle for each of the 4 maps. MAP 1 MAP 2 0 1 2 3 4 5 67 89 1011 12131415 1517 1819 (2) Hospital Builder Program On the next page, there are 4 grid-based maps each with 5 small towns shown as red squares. We would like to write a program that determines the roptimal grid location to build a hospital so that it lies at a distance that minimizes the travel from each town. That is the furthest distance that a town resident has to travel in order to reach the hospital is kept to a minimum. The answer is shown as a green circle for each of the 4 maps. MAP 1 MAP 2 0 1 2 3 4 5 67 89 1011 12131415 1517 1819