Given n points in the plane, the convex hull is the list of points, in counter-clockwise order, that describe the convex polygon that contains all the other points. imagine a rubber band is stretched around all of the points: the set of points it touches is the convex hull. you can also play around with defining your own set of points and seeing what the polygon should

fill in the following algorithm for convex hull; you do not need to prove it correct. what is its runtime? procedureconvexhull(list of pointsp[1..n])setlow: =the point with the minimumy-coordinate, breaking ties by minimumx-coordinate. create a lists[1..n-1]of the remaining points sorted by increasing angle of vector fromlow. initializehull: = [low, s[1]]forp∈s[2..n-1]doreturnhullthis algorithm reduces convex hull to sorting in linear time: given a sorting subroutine, it allows us tosolve the convex hull problem, with the other steps taking linear time