(2). For each n > 3, find a polygon with n vertices with exactly two triangulations. In other words, find a generic family of examples of n-gons, each having exactly two triangulations, such that it is clear that your family includes arbitrarily large n-gons. Extreme triangulations. Which polygons have the fewest number of triangulations distinct Can polygons have unique triangulations? Which polygons have the largest number of distinct triangulations?

Note: be spicific and type your answer or clear handwritten please.