$3$

Name:

PID:

$($b$)(4$ points$)$ Candidate Greedy Strategy $1$: Find the position that covers the most houses $($if there are several positions that tie for covering the most houses then pick the left$-$most such position.$)$

Remove the houses covered by this tower from the list and repeat the process on the remaining houses until all houses are covered.

Give a counterexample to this strategy: $(1$ point for the counterexample, $2$ points for correct application of strategy $1$ point for better solution.$)$