KöMaL 2009 B4199

A triangulation of a finite point set $A$ in the plane is defined as a partition of its convex hull into triangles such that the vertices of each triangle are elements of $A$, and no triangle contains any element of $A$ apart from its vertices. Prove that all triangulations of a set $A$ consist of the same number of triangles.