[1XW] Difficulty:*. Show that each polygon can be “triangulated”, i.e. decomposed as a union of nonoverlapping triangles. 1
[1XX]↺↻
