In C++, write a program that reads N points in a plane and outputs any group of four or more colinear points (i.e., points on the same line). The obvious brute-force algorithm requires O(N⁴) time. However, there is a better algorithm that makes use of sorting and runs in O(N²logN) time.