The convex hull problem
You must implement 3 solutions to solving the convex hull problem.
Input: n, the number of points followed by the (x, y) coordinates of each of the n points. Assume n <= 1000. Sample data:
9
3 3 3 2 3 4 2 1 2 2
2 3 5 2 4 2 1 3
Output: the name of the method, the number of points, h, in the convex hull, followed by the coordinates of the h points in counter-clockwise order, starting with the “lowest” point. For the above data and the Graham scan, you should print
Graham scan
4
(2,1) (5, 2) (3, 4) (1, 3)
Also print the time taken for the method to find the convex hull.
Your main routine must call each of your methods for finding the convex hull.