Find the number of paths from A to I if each step must be in a right-ward direction. (For example, one possible path is A, C, D, F, H, I.
Could you give a image of how the grid looks like labeled with the letters?
