Given a simple polygon P$,$ provide an algorithm that can compute a convex polygon S in O$($n$).$ A convex polygon is any shape that has all interior angles that measure less than $180$ degrees. You are given the polygon as a list of edges, each with an endpoint and startpoint. These edges are sorted in a counterclockwise direction from the bottom$-$most edge of the polygon. Hint: you can assume that you are able to calculate the angle between two line segments in O$(1).$