Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

In a convex hexagon, some diagonals are drawn so that no two of them cross in the interior of the hexagon (they may share an endpoint). Drawing no diagonals at all counts as one way. How many ways are there?