Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

How many “mountain ranges” can be drawn with $8$ upstrokes and $8$ downstrokes, that is, paths of $16$ unit diagonal steps starting and ending on the ground that never go below it?