Question 15
The diagram shows a hexagon ABCDEF partitioned into four triangles by three diagonals AC, CF and FD, no two of which intersect except at the vertices. What the total number of ways of partitioning ABCDEF into four triangles with three non-crossing diagonals?
