2018 Pascal Problem 21

A coin travels along a path that starts in an unshaded square in the top row of the figure, that uses only diagonal moves, and that ends in an unshaded square in the bottom row. A diagonal move takes the coin either one square down and one square left, or one square down and one square right. How many different paths from the top row to the bottom row are possible?

\textbf{(A)}\ 16\quad \textbf{(B)}\ 20\quad \textbf{(C)}\ 32\quad \textbf{(D)}\ 24\quad \textbf{(E)}\ 28

If there are no answer choices shown, enter a numerical answer.

Full credit to this problem is given to the CEMC, you may view all Pascal contests here.