Consider the problem of computing the convex hull of a given set of points

in the $2-$dimensional plane. Prove a good lower bound on the complexity

of the convex hull problem. $($Note that this is about the complexity of the

problem itself, not the complexity of any particular algorithm.$)$