Given an integer n≥3. Find the largest positive integer k with the following property:
For n points in general position, there exists k ways to draw a non-intersecting polygon with those n points as it’s vertices.[hide=Different wording]Given n, find the maximum k so that for every general position of n points , there are at least k ways of connecting the points to form a polygon. geometrycombinatorial geometrypointspolygon