PLEASE ANSWER #$18$

Use Problems $12$ and $17$ to design an algorithm to solve visibility $(n),$ for any $n3.$

Your answer should be in terms that can be viewed as condition$-$action pairs. You

should also prove that your algorithm works, and does so without collisions? How

many steps does your algorithm require?

Consider $n$ points $p_i=(i,\frac{i(i-1)}{2})inZZ,$ where $p_{i-1},p_i{L}_i{L}_1,L_5,L_{10}{L}_{i}nn{p}_{i}C$