Consider n points located on the x$-$axis, with x$-$coordinates x$1<$ x$2<<$ xn$.$ We want

to cover these points using unit$-$length line segments along the line y $=0.$ For instance,

if we have points $1\mathrm{.}1,1\mathrm{.}5,7\mathrm{.}5,$ then we can cover these points using two unit$-$length line

segments $($say$,[1,2],$ and $[6\mathrm{.}5,7\mathrm{.}5]).$

Give an O$($n$)-$time algorithm to find out the minimum number of unit$-$length line segments

we need to cover all the points.