There are n houses on E Street and stores are to be open on the street. A requirement is that for every house, there is at least one store within the distance of one mile. Develop a greedy algorithm to identify the minimum number of stores needed and the locations of these stores. You may assume that the distances between houses are already known (as a part of the input).

(1) Discuss the greedy-choice property that the problem may possess.

(2)Given a pseudo code for your algorithm.