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?
(A) 16
(B) 20
(C) 32
(D) 24
(E) 28

![](https://cdn.mathpix.com/cropped/2024_04_20_6ed09463f225f8ba1f07g-034.jpg?height=352&width=350&top_left_y=2166&top_left_x=1343)