A cyclic hexagon is drawn with all of its interior diagonals. All the intersections inside the hexagon are between exactly two diagonals.

Show that within the hexagon there is one embedded triangle that is formed by segments of the diagonals with all of the vertices formed by the intersections of the diagonals.

Generalize to a n-sided polygon (n>=6) and write a formula to count the number of possible embedded triangles.