Problem #WSP - 000084

Problem

Suppose there is an \(7 \times 7\) grid. We would like to travel from the bottom left corner to the top right corner in exactly 14 steps. A step is from one point on the grid to another point via a segment of length 1. How many paths are there? The picture below shows one possible path on the grid.