Hi, I need help on a discrete structure problem. Thank you!

The answer I got was 70 from the formula: (2n)! / (n!) * (n!) = 8! / 4! * 4!

12. A turtle begins at the upper left corner of a 4 x 4 grid and makes his way to the lower right corner. Along the way, he can move only right or down. The figure shows two possible paths How many paths could the turtle take? (Hint: each path can be described as a sequence of R's (right moves) and D's (down moves). Find the number of ways to distribute the R's in such a sequence.)