Given a set of points {x1, x2,. , xn} on the real line. Show using a greedy strategy how to contain all of the given points using the smallest set of unit-length closed intervals. Argue that your algorithm is correct.