Q3. Specify the best case for the Graham's algorithm, i.e. a set of N points such that the algorithm time complexity is a small as possible as function of N. (2 points) Q4. Modify the incremental algorithm to work with sets of points that may include three or more collinear points. (4 points)