Let be a square, and let be distinct points inside the square. non-intersecting segments are drawn for various pairs with , such that the square is dissected into triangles. assume each is an endpoint of at least one of the drawn segments. how many triangles are formed?