A triangulation of a convex polygon is a partition of that polygon into triangles that does not introduce any new vertices.
(a) Consider a triangle. How many triangles are in a triangulation of a triangle?
(b) There are different ways to triangulate a square. How many triangles does each have?
(c) How many triangles does any triangulation of an n-sided convex polygon have? Prove that your response is correct.